scientific article
From MaRDI portal
Publication:3262525
zbMath0089.12103MaRDI QIDQ3262525
Heinz Rutishauser, T. Ginsburg, Max E. Engeli, Eduard Stiefel
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (55)
A breakdown-free block conjugate gradient method ⋮ An Incomplete Factorization Technique for Positive Definite Linear Systems ⋮ Jordan-Elimination und Ausgleichung nach kleinsten Quadraten ⋮ The conjugate gradient method ⋮ Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ Preconditioned rotated iterative methods in the solution of elliptic partial differential equation ⋮ A note on conjugate-gradient type methods for indefinite and/or inconsistent linear systems ⋮ Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration ⋮ Fehlerabschätzungen bei Relaxationsverfahren zur numerischen Auflösung linearer Gleichungssysteme ⋮ The Lanczos phenomenon - An interpretation based upon conjugate gradient optimization ⋮ The block conjugate gradient algorithm and related methods ⋮ Roundoff-error analysis of a new class of conjugate-gradient algorithms ⋮ A Kantorovich method of solution of time-dependent electrochemical machining problems ⋮ A method for the automatic evaluation of the dynamic relaxation parameters ⋮ A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Computational methods of linear algebra ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4041215 Berechnung d�nner Rechteck- und Parallelogrammplatten mittels Splines] ⋮ Note on the non-stationary iterative method for the estimation of the optimum overrelaxation parameter ⋮ Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods ⋮ Halting time is predictable for large models: a universality property and average-case analysis ⋮ Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives ⋮ 𝑆𝑂𝑅-methods for the eigenvalue problem with large sparse matrices ⋮ Analysis of preconditioners for conjugate gradients through distribution of eigenvalues ⋮ Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations ⋮ Conjugate gradient-type algorithms for a finite-element discretization of the Stokes equations ⋮ The convergence of the method of conjugate gradients at isolated extreme points of the spectrum ⋮ On Meinardus' examples for the conjugate gradient method ⋮ A class of iterative methods for finite element equations ⋮ Numerical stability of the Chebyshev method for the solution of large linear systems ⋮ On the local convergence of certain two step iterative procedures ⋮ The Tchebychev iteration for nonsymmetric linear systems ⋮ The method of conjugate gradients in finite element applications ⋮ On the relation between dynamic relaxation and semi-iterative matrix methods ⋮ Stationary and almost stationary iterative (k,l)-step methods for linear and nonlinear systems of equations ⋮ On approximating extremals of functionals. II: Theory and generalizations related to boundary value problems for nonlinear differential equations ⋮ Convergence of the conjugate gradient method with computationally convenient modifications ⋮ Stabile Sonderfälle des Quotienten-Différenzen-Algorithmus ⋮ New iterative methods for solution of the eigenproblem ⋮ Construction of basic functions for numerical utilisation of Ritz's method ⋮ On the construction of symmetric difference operators for square and cubic lattices ⋮ Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations ⋮ Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator ⋮ Simultaneous iteration method for symmetric matrices ⋮ Relaxation bei komplexen Matrizen ⋮ On the cost of iterative computations ⋮ Iterative methods for linear systems of equations: A brief historical journey ⋮ A hybrid iterative method for symmetric indefinite linear systems ⋮ On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems ⋮ Iterative solution of linear systems in the 20th century ⋮ Eigenvalue computation in the 20th century ⋮ The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations ⋮ Yet another polynomial preconditioner for the conjugate gradient algorithm ⋮ Preconditioning techniques for large linear systems: A survey
This page was built for publication:
