Implementation of different computational variations of biconjugate residual methods

From MaRDI portal
Publication:5948897

DOI10.1016/S0898-1221(01)00236-XzbMath0983.65037MaRDI QIDQ5948897

Charles Broyden, Maria Teresa Vespucci

Publication date: 12 November 2001

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)




Related Items (14)

Convergence Results of the Biconjugate Residual Algorithm for Solving Generalized Sylvester Matrix EquationAn efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problemsSymmetric solutions of the coupled generalized Sylvester matrix equations via BCR algorithmMatrix form of Biconjugate Residual Algorithm to Solve the Discrete‐Time Periodic Sylvester Matrix EquationsBiconjugate residual algorithm for solving general Sylvester-transpose matrix equationsConjugate gradient-like methods for solving general tensor equation with Einstein productConvergence properties of BCR method for generalized Sylvester matrix equation over generalized reflexive and anti-reflexive matricesThe BCR algorithms for solving the reflexive or anti-reflexive solutions of generalized coupled Sylvester matrix equationsConjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problemsConvergence of HS version of BCR algorithm to solve the generalized Sylvester matrix equation over generalized reflexive matricesBCR method for solving generalized coupled Sylvester equations over centrosymmetric or anti-centrosymmetric matrixThe conjugate gradient methods for solving the generalized periodic Sylvester matrix equationsComputing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithmTensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product



Cites Work


This page was built for publication: Implementation of different computational variations of biconjugate residual methods