AbstractZ. Kovarik described in [SIAM J. Numer. Anal. 7 (3) (1970) 386] a method for approximate orthogonalization of a finite set of linearly independent vectors from an arbitrary (real or complex) Hilbert space. In this paper, we generalize Kovariks method in the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular real matrix. In this case we prove that, both rows and columns of the matrix are transformed in vectors which are “quasi-orthogonal”, in a sense that is clearly described. Numerical experiments are presented in the last section of the paper
AbstractIn this paper, the notion of Birkhoff–James approximate orthogonality sets is introduced for...
Abstract. A real, square matrix Q is J-orthogonal if QT JQ = J, where the signature matrix J = diag(...
In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. Th...
International audienceThe singular value decomposition C = U*Lambda*transpose(V) is among the most u...
AbstractLet A and B be rectangular matrices. Then A is orthogonal to B if∥A+μB∥⩾∥A∥foreveryscalarμ.S...
Two transformations are proposed that give orthogonal components with a one-to-one correspondence be...
Abstract—The singular value decomposition C = UΛVT is among the most useful and widespread tools in ...
AbstractAn orthogonalization procedure is given for a sequence of vectors having the special feature...
Abstract: In this paper we study sequences of vector orthogonal polynomials. The vector orthogonalit...
This thesis is concerned with the solution of linear operator equations by projection methods known ...
AbstractThe Lanczos tridiagonalization orthogonally transforms a real symmetric matrix A to symmetri...
The topic of the present thesis is the determination of good approximations through orthonormal basi...
Abstract. For many important real world problems, after the application of appropriate discretizatio...
A real, square matrix $Q$ is $J$-orthogonal if $Q^TJQ = J$, where the signature matrix $J = \diag(\p...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
AbstractIn this paper, the notion of Birkhoff–James approximate orthogonality sets is introduced for...
Abstract. A real, square matrix Q is J-orthogonal if QT JQ = J, where the signature matrix J = diag(...
In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. Th...
International audienceThe singular value decomposition C = U*Lambda*transpose(V) is among the most u...
AbstractLet A and B be rectangular matrices. Then A is orthogonal to B if∥A+μB∥⩾∥A∥foreveryscalarμ.S...
Two transformations are proposed that give orthogonal components with a one-to-one correspondence be...
Abstract—The singular value decomposition C = UΛVT is among the most useful and widespread tools in ...
AbstractAn orthogonalization procedure is given for a sequence of vectors having the special feature...
Abstract: In this paper we study sequences of vector orthogonal polynomials. The vector orthogonalit...
This thesis is concerned with the solution of linear operator equations by projection methods known ...
AbstractThe Lanczos tridiagonalization orthogonally transforms a real symmetric matrix A to symmetri...
The topic of the present thesis is the determination of good approximations through orthonormal basi...
Abstract. For many important real world problems, after the application of appropriate discretizatio...
A real, square matrix $Q$ is $J$-orthogonal if $Q^TJQ = J$, where the signature matrix $J = \diag(\p...
We describe an algorithm for complex discrete least squares approximation, which turns out to be ver...
AbstractIn this paper, the notion of Birkhoff–James approximate orthogonality sets is introduced for...
Abstract. A real, square matrix Q is J-orthogonal if QT JQ = J, where the signature matrix J = diag(...
In the paper, orthogonal transforms based on proposed symmetric, orthogonal matrices are created. Th...