Crout versions of ILU factorization with pivoting for sparse symmetric matrices.
Li, Na, Saad, Yousef (2005)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
J.R. Bunch, L. Kaufman, B.N. Parlett (1976/1977)
Numerische Mathematik
Lambers, James V. (2007)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Chen, Ke (1999)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Chan, Raymond H., Nagy, James G., Plemmons, Robert J. (1994)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Arioli, M., Maryška, J., Rozložník, M., Tůma, M. (2006)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Sleijpen, Gerard L.G., van der Horst, Henk A., Meijerbrink, Ellen (1998)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Bertaccini, Daniele (2004)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Knyazev, Andrew V., Neymeyr, Klaus (2003)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Karow, Michael (2006)
ELA. The Electronic Journal of Linear Algebra [electronic only]
G.W. Stewart, G. Zhang (1990/1991)
Numerische Mathematik
Harry Yserentant (1986/1987)
Numerische Mathematik
Nicholas J. Higham (1992)
Numerische Mathematik
Elias A. Lipitakis (1990)
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
Roy Mathias (1992)
Numerische Mathematik
Alexandre Ern, Jean-Luc Guermond (2006)
ESAIM: Mathematical Modelling and Numerical Analysis
This paper derives upper and lower bounds for the -condition number of the stiffness matrix resulting from the finite element approximation of a linear, abstract model problem. Sharp estimates in terms of the meshsize h are obtained. The theoretical results are applied to finite element approximations of elliptic PDE's in variational and in mixed form, and to first-order PDE's approximated using the Galerkin–Least Squares technique or by means of a non-standard Galerkin technique in L1(Ω). Numerical...
Jitka Křížková, Petr Vaněk (1994)
Applications of Mathematics
An algorithm of the preconditioned conjugate gradient method in which the solution of an auxiliary system is replaced with multiplication by the matrix for suitably chosen is presented.
Janovská, Drahoslava, Opfer, Gerhard (2005)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Thole, C.-A., Mayer, S., Supalov, A. (1997)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Lorella Fatone, Daniele Funaro, Valentina Scannavini (2007)
ESAIM: Mathematical Modelling and Numerical Analysis
The superconsistent collocation method, which is based on a collocation grid different from the one used to represent the solution, has proven to be very accurate in the resolution of various functional equations. Excellent results can be also obtained for what concerns preconditioning. Some analysis and numerous experiments, regarding the use of finite-differences preconditioners, for matrices arising from pseudospectral approximations of advection-diffusion boundary value problems, are presented...