A simple method for estimating the bounds of spectral radius of nonnegative irreducible matrices.
A simple recursive estimator with on-line orthogonalization of the input sequence
A solution of the continuous Lyapunov equation by means of power series
A Solver for Complex-Valued Parametric Linear Systems
This work reports on a new software for solving linear systems involving affine-linear dependencies between complex-valued interval parameters. We discuss the implementation of a parametric residual iteration for linear interval systems by advanced communication between the system Mathematica and the library C-XSC supporting rigorous complex interval arithmetic. An example of AC electrical circuit illustrates the use of the presented software.* This work was partly supported by the DFG grant GZ:...
A special finite element method based on component mode synthesis
The goal of our paper is to introduce basis functions for the finite element discretization of a second order linear elliptic operator with rough or highly oscillating coefficients. The proposed basis functions are inspired by the classic idea of component mode synthesis and exploit an orthogonal decomposition of the trial subspace to minimize the energy. Numerical experiments illustrate the effectiveness of the proposed basis functions.
A spectral characterization of the behavior of discrete time AR–representations over a finite time interval
In this paper we investigate the behavior of the discrete time AR (Auto Regressive) representations over a finite time interval, in terms of the finite and infinite spectral structure of the polynomial matrix involved in the AR-equation. A boundary mapping equation and a closed formula for the determination of the solution, in terms of the boundary conditions, are also gived.
A stable and optimal complexity solution method for mixed finite element discretizations
A stable and optimal complexity solution method for mixed finite element discretizations
We outline a solution method for mixed finite element discretizations based on dissecting the problem into three separate steps. The first handles the inhomogeneous constraint, the second solves the flux variable from the homogeneous problem, whereas the third step, adjoint to the first, finally gives the Lagrangian multiplier. We concentrate on aspects involved in the first and third step mainly, and advertise a multi-level method that allows for a stable computation of the intermediate and final...
A stable multigrid strategy for convection-diffusion using high order compact discretization.
A Stable Richardson Iteration Method for Complex Linear Systems.
A streaming approach for sparse matrix products and its application in Galerkin multigrid methods.
A structured staircase algorithm for skew-symmetric/symmetric pencils.
A Study of Semiiterative Methods for Nonsymmetric Systems of Linear Equations.
A subspace correction method for discontinuous Galerkin discretizations of linear elasticity equations
We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lamé parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed...
A survey of generalized matrix inverses
A Symmetric Numerical Range for Matrices.
A technique for computing minors of binary Hadamard matrices and application to the growth problem.
A theoretical comparison between inner products in the shift-invert Arnoldi method and the spectral transformation Lanczos method.
A tree-based dataflow model for the unsymmetric multifrontal method.
A twisted block tangential filtering decomposition preconditioner.