Results 1 to 10 of about 539,466 (113)
Accurate bidiagonal decomposition and computations with generalized Pascal matrices
Journal of Computational and Applied Mathematics, 2021 This paper provides an accurate method to obtain the bidiagonal factorization of many generalized Pascal matrices, which in turn can be used to compute with high relative accuracy the eigenvalues, singular values and inverses of these matrices. Numerical examples are included.
Jorge Delgado, J M Pena
exaly +8 more sources
Error analysis, perturbation theory and applications of the bidiagonal decomposition of rectangular totally positive h-Bernstein-Vandermonde matrices [PDF]
Linear Algebra and Its Applications, 2021 Agencia Estatal de ...
Raquel Viana +2 more
exaly +4 more sources
Accurate bidiagonal decompositions of Cauchy–Vandermonde matrices of any rank [PDF]
Numerical Linear Algebra With ApplicationsAbstractWe present a new decomposition of a Cauchy–Vandermonde matrix as a product of bidiagonal matrices which, unlike its existing bidiagonal decompositions, is now valid for a matrix of any rank. The new decompositions are insusceptible to the phenomenon known as subtractive cancellation in floating point arithmetic and are thus computable to high ...
Juan Manuel Pena +2 more
exaly +8 more sources
A differential equation approach to the singular value decomposition of bidiagonal matrices [PDF]
Linear Algebra and Its Applications, 1986 One of the most important decompositions in matrix computations is the singular value decomposition (SVD). This paper develops a continuous approximation to the SVD of bidiagonal matrices. It turns out that such an approach is totally feasible and can be fully expressed as an autonomous ordinary differential system.
Moody Chu
exaly +3 more sources
Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications [PDF]
Linear Algebra and Its Applications, 2019 Ministerio de Economía y ...
Raquel Viana +2 more
exaly +4 more sources
AxiomsThe approach to solving linear systems with structured matrices by means of the bidiagonal factorization of the inverse of the coefficient matrix is first considered in this review article, the starting point being the classical Björck–Pereyra algorithms
José-Javier Martínez
doaj +4 more sources
The Bidiagonal Singular Value Decomposition and Hamiltonian Mechanics [PDF]
SIAM Journal on Numerical Analysis, 1991 The authors present an algorithm to compute the singular value decomposition of a bidiagonal matrix \(B\) with an error bound depending on the relative gap. It is also shown that this algorithm computes the singular vectors as well as singular values to this accuracy.
Luen-Chau Li +2 more
exaly +2 more sources
Linear Algebra and Its Applications, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jose-Javier Martinez, Ana Marco Garcia
exaly +3 more sources
Green Matrices, Minors and Hadamard Products
Axioms, 2023 Green matrices are interpreted as discrete version of Green functions and are used when working with inhomogeneous linear system of differential equations.
Jorge Delgado +2 more
doaj +1 more source
Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank
Journal of Computational and Applied Mathematics, 2023 We present a method to derive new explicit expressions for bidiagonal decompositions of Vandermonde and related matrices such as the (q-, h-) Bernstein-Vandermonde ones, among others. These results generalize the existing expressions for nonsingular matrices to matrices of arbitrary rank.
Jorge Delgado 0001 +6 more
openaire +8 more sources