Yang, Dao-qi; Zhao, Jennifer
May 2003
Journal of Computational Mathematics;May2003, Vol. 21 Issue 3, p257
Academic Journal
An iterative algorithm is proposed and analyzed based on a hybridized mixed finite element method for numerically solving two-phase generalized Stefan interface problems with strongly discontinuous solutions, conormal derivatives, and coefficients. This algorithm iteratively solves small problems for each single phase with good accuracy and exchange information at the interface to advance the iteration until convergence, following the idea of Schwarz Alternating Methods. Error estimates are derived to show that this algorithm always converges provided that relaxation parameters are suitably chosen. Numeric experiments with matching and non-matching grids at the interface from different phases are performed to show the accuracy of the method for capturing discontinuities in the solutions and coefficients. In contrast to standard numerical methods, the accuracy of our method does not seem to deteriorate as the coefficient discontinuity increases.


Related Articles

  • Dual-primal FETI algorithms for edge finite-element approximations in 3D. Toselli, Andrea // IMA Journal of Numerical Analysis;Jan2006, Vol. 26 Issue 1, p96 

    A family of dual-primal finite-element tearing and interconnecting methods for edge-element approximations in 3D is proposed and analysed. The key part of this work relies on the observation that for these finite-element spaces there is a strong coupling between degrees of freedom associated...

  • Porównanie adekwatnoÅ›ci wybranych metod numerycznych do opisu pola przepÅ‚ywu w wentylatorze poprzecznym. Stacharska-Targosz, Jolanta; Chmielowiec, Monika // Systems: Journal of Transdisciplinary Systems Science;2006, Vol. 11 Issue 1, p268 

    The complexity of flow structure and the interactions of design parameters are the main reason of lack of an acceptable design procedure and accurate theoretical flow field model describing the real flow conditions in the cross flow fans. There were some theoretical approaches created the...

  • An Adaptive Least-Squares Mixed Finite Element Method for Fourth Order Parabolic Problems. Ning Chen; Haiming Gu // Applied Mathematics;Apr2013, Vol. 4 Issue 4, p675 

    A least-squares mixed finite element (LSMFE) method for the numerical solution of fourth order parabolic problems analyzed and developed in this paper. The Ciarlet-Raviart mixed finite element space is used to approximate. The a posteriori error estimator which is needed in the adaptive...

  • Computing intersections between non-compatible curves and finite elements. Durand, Raul; Farias, Márcio; Pedroso, Dorival // Computational Mechanics;Sep2015, Vol. 56 Issue 3, p463 

    This paper presents a method to find all intersections between curved lines such as structural line elements and finite element meshes with intentions to generate smaller, non-compatible, line cells (e.g. bar elements) between crossings. The intersection finding algorithm works for two and...

  • On the Analysis of the Fedorenko Finite Superelement Method for Simulation of Processes with Small-Scale Singularities. Galanin, M.; Lazareva, S. // AIP Conference Proceedings;10/29/2009, Vol. 1186 Issue 1, p327 

    The paper shows the a-priori error estimates for the Fedorenko finite superelement method in application to physical problems with small-scale singularities.

  • Computations of form and stability of rotating drops with finite elements. Heine, Claus-Justus // IMA Journal of Numerical Analysis;Oct2006, Vol. 26 Issue 4, p723 

    We consider the numerical computation of equilibrium shapes of rotating drops and their bifurcations, depending on the angular velocity. The drops are subject to centrifugal forces and surface tension alone. We present a path-tracking algorithm which is based on the discretisation of a...

  • A Generalized Hard Thresholding Pursuit Algorithm. Li, Haifeng; Fu, Yuli; Zhang, Qiheng; Rong, Rong // Circuits, Systems & Signal Processing;Apr2014, Vol. 33 Issue 4, p1313 

    Compressed sensing ensures the accurate reconstruction of sparse signals from far fewer samples than required in the classical Shannon-Nyquist theorem. In this paper, a generalized hard thresholding pursuit (GHTP) algorithm is presented that can recover unknown vectors without the sparsity level...

  • A contact searching algorithm including bounding volume trees applied to finite sliding mortar formulations. Bin Yang; Laursen, Tod A. // Computational Mechanics;Jan2008, Vol. 41 Issue 2, p189 

    This paper presents a new contact searching algorithm for large deformation mortar-based contact formulations. In this algorithm, a bounding volume hierarchy, defined in the context of a binary tree, is built for each contact surface based on the geometry of the surface. A global contact...

  • Efficient version of multilevel compressed block decomposition for finite-element-based analysis of electromagnetic problems. Fan, Z.; Jiang, Z.; Chen, R.; Wan, T.; Zhu, K. // IET Microwaves, Antennas & Propagation;Apr2012, Vol. 6 Issue 5, p527 

    This work investigates the feasibility of utilising the multilevel compressed block decomposition algorithm (MLCBD) to increase the efficiency of solving the matrix equation obtained from the finite-element method in the electromagnetic analysis. The MLCBD takes advantage of the low-rank...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics