A direct solver for the least‐squares problem arising from GMRES(k)

DOI10.1002/cnm.1640100909zbMath0812.65034OpenAlexW2038058877MaRDI QIDQ4314948

Manuel J. Galán, G. Montero, Gabriel Winter

Publication date: 14 May 1995

Published in: Communications in Numerical Methods in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cnm.1640100909

zbMATH Keywords

unconstrained optimizationiterative methodleast squares problemGMRES methodgeneralized minimal residual methodvector/parallel computers

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items (2)

Approximate inverse computation using Frobenius inner product ⋮ Solving optimal control problems by GAs

Cites Work

• Implementation of the GMRES Method Using Householder Transformations
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• The effect of ordering on preconditioned GMRES algorithm, for solving the compressible Navier‐Stokes equations
• A Flexible Inner-Outer Preconditioned GMRES Algorithm
• A Theoretical Comparison of the Arnoldi and GMRES Algorithms

This page was built for publication: A direct solver for the least‐squares problem arising from GMRES(k)