Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme

From MaRDI portal
Revision as of 10:46, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:766500

DOI10.1007/BF02564277zbMath0066.36703MaRDI QIDQ766500

Eduard Stiefel

Publication date: 1955

Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/139101




Related Items (32)

BiCGCR2: A new extension of conjugate residual method for solving non-Hermitian linear systemsThe conjugate gradient methodMINRES: From Negative Curvature Detection to Monotonicity PropertiesEstimates in quadratic formulasLanczos-type variants of the COCR method for complex nonsymmetric linear systemsThe CBiCG class of algorithms for complex symmetric linear systems with applications in several electromagnetic model problemsA framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger WeißThe Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and MethodologyExtrapolation vs. projection methods for linear systems of equationsAvoiding breakdown in variants of the BI-CGSTAB algorithmBiCR-type methods for families of shifted linear systemsAn application of the discrete-time Toda lattice to the progressive algorithm by Lanczos and related problemsMatrix iteration algorithms for solving the generalized Lyapunov matrix equationLarge scale finite element computations with GMRES-like methods on a Cray Y-MPResidual smoothing and peak/plateau behavior in Krylov subspace methodsFehlerabschätzungen bei Relaxationsverfahren zur numerischen Auflösung linearer GleichungssystemeAbstract perturbed Krylov methodsConverting BiCR method for linear equations with complex symmetric matricesnlTGCR: A Class of Nonlinear Acceleration Procedures Based on Conjugate ResidualsDescent Properties of an Anderson Accelerated Gradient Method with RestartingAnalyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient MethodUnnamed ItemError behavior in optimal relaxation methodsAccelerated Landweber iterations for the solution of ill-posed equationsAn Extension of the COCR Method to Solving Shifted Linear Systems with Complex Symmetric MatricesLimiting accuracy of segregated solution methods for nonsymmetric saddle point problemsConjugate gradient algorithms and the Galerkin boundary element methodThe Conjugate Residual Method in Linesearch and Trust-Region MethodsSchur complement reduction in the mixed-hybrid approximation of Darcy's law: Rounding error analysisIterative Lösung und Fehlerabschätzung in der AusgleichsrechnungCauchy's method of minimizationOn polynomial preconditioning and asymptotic convergence factors for indefinite Hermitian matrices







This page was built for publication: Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme