Results 31 to 40 of about 160 (114)
Geršhgorin-type theorems for Z1-eigenvalues of tensors with applications
Demonstratio MathematicaIn this article, we present several Geršhgorin-type theorems for Z1{Z}_{1}-eigenvalues of tensors, which improve the results provided by Wang et al. (Some upper bounds on Zt{Z}_{t}-eigenvalues of tensors, Appl. Math. Comput.
Shen Xiaowei +3 more
doaj +1 more source
, 2016 The eigenstructure of genuine Beta operators is described, a limiting case of Beta-Jacobi operators. Its similarity to that of the classical Bernstein operators is emphasized.
HEILMANN, Margareta +2 more
core
Restarted block Lanczos bidiagonalization methods, Numer. Algorithms
, 2008 . The problem of computing a few of the largest or smallest singular values and associated singular vectors of a large matrix arises in many applications.
James Baglama, Lothar Reichel
core
A NEW JUSTIFICATION OF THE JACOBI–DAVIDSON METHOD FOR LARGE EIGENPROBLEMS
, 2008 . The Jacobi–Davidson method is known to converge at least quadratically if the correction equation is solved exactly, and it is common experience that the fast convergence is maintained if the correction equation is solved only approximately.
Heinrich Voss, Ax Λx
core
INTERVAL ITERATIVE METHODS FOR COMPUTING MOORE-PENROSE INVERSE ∗
, 2008 In this paper, we import interval method to the iteration for computing Moore-Penrose inverse of the full row (or column) rank matrix. Through modifying the classical Newton iteration by interval method, we can get better numerical results.
Xian Zhang, Yimin Wei, Jianfeng Cai
core
Perturbation Bounds For Isotropic Invariant Subspaces Of Skew-Hamiltonian Matrices
, 2008 We investigate the behavior of isotropic invariant subspaces of skew-Hamiltonian matrices under structured perturbations. It is shown that finding a nearby subspace is equivalent to solving a certain quadratic matrix equation.
Daniel Kressner
core
A BLOCK RAYLEIGH QUOTIENT ITERATION WITH LOCAL QUADRATIC CONVERGENCE
, 2008 . We present an iterative method, based on a block generalization of the Rayleigh Quotient Iteration method, to search for the p lowest eigenpairs of the generalized matrix eigenvalue problem Au = Bu.
Jean-luc Fattebert Y
core
COVID-19 pandemic and lockdown: what has changed in common home accidents such as foreign bodies and corrosive injuries? [PDF]
Pediatr Surg Int, 2022 Balcı Ö +8 more
europepmc +1 more source
, 1996 Summary. We use a simple matrix splitting technique to give an elementary new proof of the Lidskii-Mirsky-Wielandt Theorem and to obtain a multiplicative analog of the Lidskii-Mirsky-Wielandt Theorem, which we argue is the fundamental bound in the study ...
Chi-kwong Li, Roy Mathias
core
The Sinkhorn-Knopp algorithm: convergence and applications [PDF]
, 2006 . As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Philip A. Knight, Knight, Philip A.
core +1 more source