Numerical methods for the computation of analytic singular value decompositions.
Numerical operations among rational matrices: standard techniques and interpolation
Numerical operations on and among rational matrices are traditionally handled by direct manipulation with their scalar entries. A new numerically attractive alternative is proposed here that is based on rational matrix interpolation. The procedure begins with evaluation of rational matrices in several complex points. Then all the required operations are performed consecutively on constant matrices corresponding to each particular point. Finally, the resulting rational matrix is recovered from the...
Numerical Procedure for Solving a Minimization Eigenvalue Problem.
Numerical simulations of glacial rebound using preconditioned iterative solution methods
This paper discusses finite element discretization and preconditioning strategies for the iterative solution of nonsymmetric indefinite linear algebraic systems of equations arising in modelling of glacial rebound processes. Some numerical experiments for the purely elastic model setting are provided. Comparisons of the performance of the iterative solution method with a direct solution method are included as well.
Numerical Solution of Eigentuple-Eigen vector Problems in Hilbert Spaces by a Gradient Method.
Numerical Solution of Linear Equations with Toeplitz and Vector Toeplitz Matrices.
Numerical Stability of Decent Methods for Solving Linear Equations.
Numerical Stability of the Chebyshev Method for the Solution of Large Linear Systems.
Numerical stability of the cyclic Richardson iteration.
Numerical study of two sparse AMG-methods
A sparse algebraic multigrid method is studied as a cheap and accurate way to compute approximations of Schur complements of matrices arising from the discretization of some symmetric and positive definite partial differential operators. The construction of such a multigrid is discussed and numerical experiments are used to verify the properties of the method.
Numerical Study of Two Sparse AMG-methods
A sparse algebraic multigrid method is studied as a cheap and accurate way to compute approximations of Schur complements of matrices arising from the discretization of some symmetric and positive definite partial differential operators. The construction of such a multigrid is discussed and numerical experiments are used to verify the properties of the method.
Numerical study of two-level additive Schwarz preconditioner for discontinuous Galerkin method solving elliptic problems
The paper deals with the analysis and numerical study of the domain decomposition based preconditioner for algebraic systems arising from the discontinuous Galerkin (DG) discretization of the linear elliptic problems. We introduce the DG discretization of the model problem and present the spectral -bound of the corresponding linear algebraic systems. Moreover, we present the two-level additive Schwarz preconditioner together with the theoretical result related to the estimate of the condition number....
Numerically stable algorithm for pole assignment of linear single-input systems
Numerické metody a počítače
Obere Schranken für Eigenwerte von Eigenwertaufgaben der Form (...2 I Â?...A Â? B) x = 0 . - Upper Bounds for Eigenvalues of Quadratic Eigenvalue Problem.
Oblique projection methods for linear systems with multiple right-hand sides.
Obtaining bounds on the two norm of a matrix from the splitting lemma.
On a Class of Chebyshev Approximation Problems Which Arise in Connection with a Conjugate Gradient Type Method.
On a Class of Jacobi-Like Procedures for Diagonalising Arbitrary Real Matrices.
On a class of matrices which arise in the numerical solution of Euler equations.