credit
发表于 2025-3-21 16:30:37
书目名称Matrix Pencils影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0627765<br><br> <br><br>书目名称Matrix Pencils读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0627765<br><br> <br><br>
FLEET
发表于 2025-3-21 23:53:52
http://reply.papertrans.cn/63/6278/627765/627765_2.png
罗盘
发表于 2025-3-22 02:04:12
,An approach to solving the spectral problem of A-λB,
ferment
发表于 2025-3-22 05:14:09
,On computing the Kronecker canonical form of regular (A-λB)-pencils,
惰性气体
发表于 2025-3-22 10:01:08
http://reply.papertrans.cn/63/6278/627765/627765_5.png
Detonate
发表于 2025-3-22 16:56:23
A method for computing the generalized singular value decomposition,
恸哭
发表于 2025-3-22 19:07:51
The multivariate calibration problem in chemistry solved by the PLS method,
隐士
发表于 2025-3-22 22:57:23
http://reply.papertrans.cn/63/6278/627765/627765_8.png
Awning
发表于 2025-3-23 01:53:56
Differential/algebraic systems and matrix pencils,and economically using a range of ODE methods. Others can be solved only by a small subset of ODE methods, and still others present insurmountable difficulty for all current ODE methods. We examine the first two groups of problems and indicate which methods we believe to be best for them. Then we ex
泄露
发表于 2025-3-23 05:39:24
Projection methods for solving large sparse eigenvalue problems,ction methods, i.e. Galerkin type methods, and include the most commonly used algorithms for solving large sparse eigenproblems like the Lanczos algorithm, Arnoldi‘s method and the subspace iteration. We first derive some a priori error bounds for general projection methods, in terms of the distance