Results 191 to 200 of about 197,517 (218)
Walking on the Edge: Brain Connectivity Changes in Response to Virtual Height Challenges. [PDF]
Eur J NeurosciCupertino L +6 more
europepmc +1 more source
Semantic memory and creative evaluation. [PDF]
BMC PsycholSkurnik A, Ackerman R, Kenett YN.
europepmc +1 more source
A Comparison of Skeletal Muscle Diffusion Tensor Imaging Tractography Seeding Methods. [PDF]
NMR BiomedDamon BM +3 more
europepmc +1 more source
Saccades influence functional modularity in the human cortical vision network. [PDF]
Sci RepTomou G +3 more
europepmc +1 more source
Multiomics Analysis Reveals Insights into Potential Drivers of Pancreatic Islet Pathology in Type 2 Diabetes. [PDF]
ACS OmegaHouser MC +13 more
europepmc +1 more source
Eigenvalues and eigenvectors [PDF]
, 2010 Given a square matrix \( {\rm A} \in \mathbb{C}^{{n \times n}} \), the eigenvalue problem consists in finding a scalar λ (real or complex) and a nonnull vector x such that $${\rm Ax} = \lambda{\rm x}$$ (6.1) Any such λ is called an eigenvalue of A, while x is the associated eigenvector.
Alfio Quarteroni +3 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
BIT Numerical Mathematics, 2003
The authors investigate the conditions under which it is possible to estimate and compute error bounds on a computed eigenvector of a finite matrix. It is shown that nontrivial error bounds on an eigenvector are computable if and only if its geometric multiplicity is one. They also provide an algorithm for the computation of these error bounds and show
Jens-Peter M. Zemke, Siegfried M. Rump
openaire +2 more sources
The authors investigate the conditions under which it is possible to estimate and compute error bounds on a computed eigenvector of a finite matrix. It is shown that nontrivial error bounds on an eigenvector are computable if and only if its geometric multiplicity is one. They also provide an algorithm for the computation of these error bounds and show
Jens-Peter M. Zemke, Siegfried M. Rump
openaire +2 more sources
1986
Recall that an n × n matrix B is similar to an n × n matrix A if there is an invertible n × n matrix P such that B = P −1 AP. Our objective now is to determine under what conditions an n × n matrix is similar to a diagonal matrix. In so doing we shall draw together all of the notions that have been previously developed.
T. S. Blyth, Edmund F. Robertson
openaire +2 more sources
Recall that an n × n matrix B is similar to an n × n matrix A if there is an invertible n × n matrix P such that B = P −1 AP. Our objective now is to determine under what conditions an n × n matrix is similar to a diagonal matrix. In so doing we shall draw together all of the notions that have been previously developed.
T. S. Blyth, Edmund F. Robertson
openaire +2 more sources