Mesh independence principle for nonlinear equations on hilbert spaces by preconditioning

References

• Adam D. M.I.P. of Newton's method for Galerkin type discretizations Preprint nr. 34, Dept. of Math. Increst, Bucharest 1988
   Google Scholar
• Allgower , E. L. 1986 . A mesh-independence principle for operator equations and their discretizations . SIAM J. Numer. Anal. , 23 : 160 – 160 .
   Web of Science ®Google Scholar
• Cea , J. 1978 . Tata Inst, of Fundam. Research . Optimization-Theory and Algorithms , 53 Bombay
   Google Scholar
• Ciarlet , Ph. G. 1979 . The finite element method for elliptic problems , Amsterdam : North-Holland .
   Google Scholar
• Ciarlet , Ph. G. 1969 . Numerical methods of high-order accuracy for nonlinear boundary value problems . Numer. Math. , 13 : 51 – 77 .
   Google Scholar
• Fix , G. J. and Strang , G. 1973 . An analysis of the finite element method , New-Jersey : Prentice-Hall .
   Google Scholar
• Meijerink , J. A. and Van der Vorst , H. A. 1977 . An iterative solution method for linear systems of which the coefficient matrix is a symmetric . M-matrix, Math. of Comput. , 31 : 148 – 162 .
   Web of Science ®Google Scholar
• Meijerink , J. A. and Van der Vorst , H. A. 1981 . Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems . Journal of Comput. Physics , 44 : 134 – 153 .
   Web of Science ®Google Scholar
• Popa , C. 1994 . Mesh independence of the condition number of discrete Galerkin systems by preconditioning . Intern. J. Computer Math. , 51 : 127 – 132 .
   Web of Science ®Google Scholar
• Popa , C. 1995 . Preconditioning conjugate gradient method for nonsymmetric systems . Intern. J. Computer Math. , 58 : 117 – 133 .
   Web of Science ®Google Scholar
• A revision of multiplicity and parametric sensivity concepts in nonisothermal nonadiabatic packed bed chemical reactor . Chem. Engng. Sci. , 36 1605 – 1609 .
   Google Scholar
• Saad , Y. and Schultz , M. H. 1989 . GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems . SIAM J. Sci. Stat. Comput. , 7 : 856 – 869 .
   Google Scholar
• Sonneveld , P. 1989 . CGS, a fast Lanczos-type solver for nonsymmetric linear systems . SIAM J. Sci. Stat. Comput. , 10 : 36 – 52 .
   Web of Science ®Google Scholar