Computation of the Smallest Positive Eigenvalue of a Quadratic ..-matrix.
Computing and Visualizing Solution Sets of Interval Linear Systems
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006The computation of the exact solution set of an interval linear system is a nontrivial task [2, 13]. Even in two and three dimensions a lot of work has to be done. We demonstrate two different realizations. The first approach (see [16]) is based on Java, Java3D, and the BigRational package [21]. An applet allows modifications of the matrix coefficients and/or the coefficients...
Computing codimensions and generic canonical forms for generalized matrix products.
Computing with Laguerre polynomials.
Computing exponential for iterative splitting methods: algorithms and applications.
Computing generalized inverse systems using matrix pencil methods
We address the numerically reliable computation of generalized inverses of rational matrices in descriptor state-space representation. We put particular emphasis on two classes of inverses: the weak generalized inverse and the Moore-Penrose pseudoinverse. By combining the underlying computational techniques, other types of inverses of rational matrices can be computed as well. The main computational ingredient to determine generalized inverses is the orthogonal reduction of the system matrix pencil...
Computing the CS and the Generalized Singular Value Decompositions.
Computing the CS Decomposition of a Partitioned Orthonormal Matrix
Computing the determinants by reducing the orders by four.
Computing the Ideal Structure of Finite Semigroups.
Concerning decomposition of a system of linear algebraic equations
Concerning the Solution Set of Ax = b where P< A < Q and p < b < q.
Condition number analysis for various forms of block matrix preconditioners.
Condition numbers of the Krylov bases and spaces associated with the truncated iteration.
Cones and error bounds for linear iterations.
Conjugate Direction Methods for Solving Systems of Linear Equations.
Constrained least squares methods for linear timevarying DAE systems.
Constructing matrix geometric means.
Constructive Sobolev gradient preconditioning for semilinear elliptic systems.
Contribuciones a la generalización del problema de compensación por grupos de Helmert-Pranis Pranievich.
The paper presents in a generalized form the problem of the geodetic network adjustment by the Helmert-Pranis Pranievich groups method (groups with junction points included or not). The adjustment problem, as well as the cofactor matrix derivation for the partial-independent and linkage unknowns, was completely formulated by transformed weight matrix definition and usage. A complete sequence of the computing stages for the geodetic networks divided into groups without junction points was given for...