An unconditionally energy stable time stepping scheme is introduced to solve CahnMorral-like equations in the present study. It is constructed based on the combination of David Eyre’s time stepping scheme and Schur complement approach. Although the presented method is general and independent to the choice of homogeneous free energy density function term, logarithmic and polynomial energy functi...

The Reissner-Mindlin plate models thin plates. The condition numbers of finite element approximations of these plate models increase very rapidly as the thickness of the plate goes to 0. A Balancing Domain Decomposition by Constraints (BDDC) Deluxe method is developed for these plate problems discretized by Falk-Tu finite elements. In this new algorithm, subdomain Schur complements restricted t...

in this work, the solution of a boundary value problem is discussed via asemi analytical method. the purpose of the present paper is to inspect theapplication of the adomian decomposition method for solving the nagumotelegraph equation. the numerical solution is obtained for some special casesso that demonstrate the validity of method.

n this paper, we apply picard’s iteration method followed by adomian decomposition method to solve a nonlinear singular cauchy problem of euler- poisson- darboux equation. the solution of the problem is much simplified and shorter to arriving at the solution as compared to the technique applied by carroll and showalter (1976)in the solution of singular cauchy problem.

This paper studies the solution of quadratic eigenvalue problems by the quadratic residual iteration method. The focus is on applications arising from nite-element simulations in acoustics. One approach is the shift-invert Arnoldi method applied to the linearized problem. When more than one eigenvalue is wanted, it is advisable to use locking or de-ation of converged eigenvectors (or Schur vect...

The most popular method for computing the matrix logarithm is a combination of inverse scaling and squaring in conjunction with Padé approximation, sometimes accompanied by Schur decomposition. In this work, we present Taylor series algorithm, based on free-transformation approach technique, that uses recent polynomial formulas evaluating approximation more efficiently than Paterson–Stockmeyer ...

and contributions A finite element method often leads to large sparse symmetric and positive definite systems of linear equations. If memory capacity or computing performance of a single CPU are not sufficient for solving such large linear systems, then parallelisation must be used. The parallel solution by the Schur complement method, on homogeneous parallel machines with distributed memory, i...

and contributions A finite element method often leads to large sparse symmetric and positive definite systems of linear equations. If memory capacity or computing performance of a single CPU are not sufficient for solving such large linear systems, then parallelisation must be used. The parallel solution by the Schur complement method, on homogeneous parallel machines with distributed memory, i...

The p-version nite element method for linear, second order elliptic equations in an arbitrary, suuciently smooth domain is studied in the framework of the Domain Decomposition (DD) method. Two types of square reference elements are used with the products of the integrated Legendre polynomials for coordinate functions. Estimates for the condition numbers are given, preconditioning of the problem...

We developed parallel time domain decomposition methods to solve systems of linear ordinary differential equations (ODEs) based on the Aitken-Schwarz [5] or primal Schur complement domain decomposition methods [4]. The methods require the transformation of the initial value problem in time defined on ]0,T ] into a time boundary values problem. Let f (t,y(t)) be a function belonging to C 1(R+,Rd...