Results 1 to 10 of about 197,054 (272)
An Improved Two-Stage RARE Algorithm for Mixed Far-Field and Near-Field Source Localization Under Unknown Mutual Coupling with the Uniform Linear Sensor Array. [PDF]
Sensors (Basel)Chen K, Deng K, Zhang J.
europepmc +1 more source
Reply to Koplenig and Wolfer: Global language analyses must account for relationships, location, and unbalanced binary data. [PDF]
Proc Natl Acad Sci U S AHua X, Bromham L.
europepmc +1 more source
Understanding Peelle's Pertinent Puzzle bias in generalized least squares regression through eigenspectrum analysis. [PDF]
Sci RepWalton NAW +5 more
europepmc +1 more source
Associations between micro- and macro level social network properties and individual productivity in virtual collaboration. [PDF]
Sci RepDeng D, Koltai J.
europepmc +1 more source
Bridging the short-term and long-term dynamics of economic structural change. [PDF]
Nat CommunMcNerney J +3 more
europepmc +1 more source
Dynamical network markers for heterogeneous hierarchical networks. [PDF]
Sci RepSaito Y, Sasahara H, Imura JI.
europepmc +1 more source
Some of the next articles are maybe not open access.
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
Rump, Siegfried M., Zemke, Jens-Peter M.
openaire +1 more source
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
Rump, Siegfried M., Zemke, Jens-Peter M.
openaire +1 more source