On the Global Convergence of the Eberlein Method for Real Matrices.
On the Invariance of Perturbed Null Vectors Under Column Scaling.
On the inverse eigenvalue problem for a special kind of acyclic matrices
We study an inverse eigenvalue problem (IEP) of reconstructing a special kind of symmetric acyclic matrices whose graph is a generalized star graph. The problem involves the reconstruction of a matrix by the minimum and maximum eigenvalues of each of its leading principal submatrices. To solve the problem, we use the recurrence relation of characteristic polynomials among leading principal minors. The necessary and sufficient conditions for the solvability of the problem are derived. Finally, a...
On the local convergence of Kung-Traub's two-point method and its dynamics
In this paper, the local convergence analysis of the family of Kung-Traub's two-point method and the convergence ball for this family are obtained and the dynamical behavior on quadratic and cubic polynomials of the resulting family is studied. We use complex dynamic tools to analyze their stability and show that the region of stable members of this family is vast. Numerical examples are also presented in this study. This method is compared with several widely used solution methods by solving test...
On the LU Factorization of M-Matrices.
On the Monotonity of Incomplete Factorization.
On the Multigrid Solution of Finite Element Equations With Isoparametric Elements.
On the Multi-Level Splitting of Finite Element Squares.
On the Numerical Errors in One Step Algorithms for Time Dependent Problems.
On the parallel solution of tridiagonal systems by wrap-around partitioning and incomplete LU factorization.
On the parameter in augmented Lagrangian preconditioning for isogeometric discretizations of the Navier-Stokes equations
In this paper, we deal with the optimal choice of the parameter for augmented Lagrangian preconditioning of GMRES method for efficient solution of linear systems obtained from discretization of the incompressible Navier-Stokes equations. We consider discretization of the equations using the B-spline based isogeometric analysis approach. We are interested in the dependence of the convergence on the parameter for various problem parameters (Reynolds number, mesh refinement) and especially for...
On the parametric solution to the second-order Sylvester matrix equation .
On the partitioned matrix and its associated system
On the periodic quotient singular value decomposition.
On the preconditioned biconjugate gradients for solving linear complex equations arising from finite elements
The paper analyses the biconjugate gradient algorithm and its preconditioned version for solving large systems of linear algebraic equations with nonsingular sparse complex matrices. Special emphasis is laid on symmetric matrices arising from discretization of complex partial differential equations by the finite element method.
On the pseudoinverse of a sum of symmetric matrices with applications to estimation
On the Quadratic Convergence of the Special Cyclic Jacobi Method.
On the Rate of Convergence of the Preconditioned Conjugate Gradient Method.
On the reduction of a Hamiltonian matrix to Hamiltonian Schur form.
On the reduction of a random basis
For p ≤ n, let b1(n),...,bp(n) be independent random vectors in with the same distribution invariant by rotation and without mass at the origin. Almost surely these vectors form a basis for the Euclidean lattice they generate. The topic of this paper is the property of reduction of this random basis in the sense of Lenstra-Lenstra-Lovász (LLL). If is the basis obtained from b1(n),...,bp(n) by Gram-Schmidt orthogonalization, the quality of the reduction depends upon the sequence of ratios...