Direct methods for matrix Sylvester and Lyapunov equations.
Directed forests with application to algorithms related to Markov chains
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Discrete wavelet transforms accelerated sparse preconditioners for dense boundary element systems.
Discrete-time symmetric polynomial equations with complex coefficients
Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.
Displacement preconditioner for Toeplitz least squares iterations.
Displacement Structure of Generalized Inverse At,s(1,2)
Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes.
Domain decomposition methods coupled with parareal for the transient heat equation in 1 and 2 spatial dimensions
We present a parallel solution algorithm for the transient heat equation in one and two spatial dimensions. The problem is discretized in space by the lowest-order conforming finite element method. Further, a one-step time integration scheme is used for the numerical solution of the arising system of ordinary differential equations. For the latter, the parareal method decomposing the time interval into subintervals is employed. It leads to parallel solution of smaller time-dependent problems. At...
Domain Embedding Methods for the Stokes Equations.
Domains of Divergence of the USSOR Method Applied on p-Cyclic Matrices.
Dual variable methods for mixed-hybrid finite element approximation of the potential fluid flow problem in porous media.
Dynamical systems method for solving linear finite-rank operator equations
A version of the dynamical systems method (DSM) for solving ill-conditioned linear algebraic systems is studied. An a priori and an a posteriori stopping rules are justified. An iterative scheme is constructed for solving ill-conditioned linear algebraic systems.
Efficiency of cropping system designs via base contrast
The present article is a continuation of previous papers by the same authors devoted to the efficiency of crop rotation experiments. We focus on plans distinguished by the cyclical pattern of the incidence matrix. For practical reasons, we slightly modify the efficiency coefficient. The relation between the resulting efficiency coefficients is examined. In addition, we provide a background material on crop rotation experiments.
Efficient algorithms for solving nonlinear Volterra integro-differential equations with two point boundary conditions.
Efficient computation of enclosures for the exact solvents of a quadratic matrix equation.
Efficient Computing of some Vector Operations over GF(3) and GF(4)
The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.
Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems.
Efficient FORTRAN implementation of the gaussian elimination and Householder reduction algorithms on the IBM 3090 vector multiprocessor
Efficient Implementation of Jacobi's Diagonalization Method on the DAP.
Efficient iterative solution of linear systems from discretizing singular integral equations.