Results 81 to 90 of about 36,403 (314)
Approximate eigenvectors as preconditioner
Linear Algebra and its Applications, 2000 Given approximate eigenvector matrix of a Hermitian nonsingular matrix H, the spectral decomposition of H can be obtained by computing H´=*H and then diagonalizing H´. This work addresses the issue of numerical stability of the transition from H to H´ in finite precision arithmetic.
Krešimir Veselić, Zlatko Drmač
openaire +3 more sources
Electronic CPA‐Laser Having Enhanced Sensitivity and Tunability
Advanced Electronic Materials, EarlyView.Coherent perfect absorber (CPA) laser points are peculiar singularities possessed by parity−time symmetric systems. They have demonstrated great potential for sensing applications, albeit hindered by the non‐tunability and structural limitations. This work introduces a tunable CPA laser system in a reader‐sensor scheme, whose sensitivity can be further
Minye Yang +7 more
wiley +1 more source
Observations on the Computation of Eigenvalue and Eigenvector Jacobians
Algorithms, 2019 Many scientific and engineering problems benefit from analytic expressions for eigenvalue and eigenvector derivatives with respect to the elements of the parent matrix.
Andrew J. Liounis +2 more
doaj +1 more source
The eigenvectors of the right-justified Pascal triangle [PDF]
arXiv, 2000 We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.
arxiv
Agribusiness, EarlyView.ABSTRACT Social tensions and resource depletion pose significant challenges to the agri‐food sector, highlighting the need for coordinated strategies to ensure sustainability in supply chains. Despite its critical importance, the relationship between coordination mechanisms and sustainability performance remains underexplored.
Carlos Moreno‐Miranda, Liesbeth Dries
wiley +1 more source
Scientia Agricola, 2008 Some techniques of multivariate statistical analysis can only be conducted on a complete data matrix, but the process of data collection often misses some elements. Imputation is a technique by which the missing elements are replaced by plausible values,
Genevile Carife Bergamo +2 more
doaj +1 more source
An Exact Method for Calculating the Eigenvector Sensitivities
Applied Sciences, 2020 Eigenvector sensitivities are often used in many engineering problems such as structural vibration control, optimization design, model updating and damage identification. So far, modal superposition method and Nelson’s method are the two main methods for
Qiuwei Yang, Xi Peng
doaj +1 more source
Computing Eigenvectors from Eigenvalues In an Arbitrary Orthonormal Basis [PDF]
arXiv, 2019 The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation of eigenvectors of an orthonormal basis projection using eigenvalues of sub-projections.
arxiv
Solution of boundary value problems for batteries: Operator‐theoretic methods
AIChE Journal, EarlyView.Abstract Batteries with porous electrodes of negligible ionic and electronic conduction resistance are modeled with reaction‐diffusion equations in multilayered media. The classical separation of variables becomes inapplicable to battery problems because of nonlinearities in reaction rates and constraints of imposed current. A linear operator‐theoretic
Doraiswami Ramkrishna +1 more
wiley +1 more source
Robust Eigenvector of a Stochastic Matrix with Application to PageRank [PDF]
arXiv, 2012 We discuss a definition of robust dominant eigenvector of a family of stochastic matrices. Our focus is on application to ranking problems, where the proposed approach can be seen as a robust alternative to the standard PageRank technique. The robust eigenvector computation is reduced to a convex optimization problem. We also propose a simple algorithm
arxiv