Results 11 to 20 of about 691 (188)

Improved matrix pencil methods [PDF]

Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284), 2002
We study the problem of estimating signal parameters from a noisy data sequence containing superimposed damped sinusoids. We propose three novel methods by combining the reduced-rank Hankel approximation and the matrix pencil method. We demonstrate that two of the proposed methods significantly outperform both the original matrix pencil method and the ...
null Biao Lu, null Dong Wei, B.L. Evans, A.C. Bovik   +3 more
openaire   +1 more source

Convergent matrix pencils

Applied Mathematics Letters, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jódar, L., Casabán, M.C.
openaire   +1 more source

On the Trail of Creativity: Dimensionality of Divergent Thinking and Its Relation With Cognitive Abilities, Personality, and Insight

European Journal of Personality, EarlyView., 2020
Abstract Divergent thinking (DT) is an important constituent of creativity that captures aspects of fluency and originality. The literature lacks multivariate studies that report relationships between DT and its aspects with relevant covariates, such as cognitive abilities, personality traits (e.g. openness), and insight. In two multivariate studies (N 
S. Weiss, D. Steger, Y. Kaur, A. Hildebrandt, U. Schroeders, O. Wilhelm, Christian Kandler   +6 more
wiley   +1 more source

Efficient Parameter Estimation and Implementation of a Contour Integral-Based Eigensolver

Journal of Algorithms & Computational Technology, 2013
We consider an eigensolver for computing eigenvalues in a given domain and the corresponding eigenvectors of large-scale matrix pencils. The Sakurai-Sugiura (SS) method is an eigensolver based on complex moments given by contour integrals of matrix ...
Tetsuya Sakurai, Yasunori Futamura, Hiroto Tadano   +2 more
doaj   +1 more source

Classical orthogonal polynomials and Leverrier-Faddeev algorithm for the matrix pencils sE−A

International Journal of Mathematics and Mathematical Sciences, 2006
In this contribution we present an extension of the Leverrier-Faddeev algorithm for the simultaneous computation of the determinant and the adjoint matrix B(s) of a pencil sE−A where E is a singular matrix but det⁡(sE−A)≢0. Using a previous result by the
Javier Hernández, Francisco Marcellán
doaj   +1 more source

A GPU Solver for Sparse Generalized Eigenvalue Problems With Symmetric Complex-Valued Matrices Obtained Using Higher-Order FEM

IEEE Access, 2018
This paper discusses a fast implementation of the stabilized locally optimal block preconditioned conjugate gradient method, using a hierarchical multilevel preconditioner to solve non-Hermitian sparse generalized eigenvalue problems with large symmetric
Adam Dziekonski, Michal Mrozowski
doaj   +1 more source

Matrix pencil generated by a tensor product from two matrix pencils

Linear Algebra and its Applications, 1996
A pencil of matrices \(\lambda A-B\in\mathbb{C}[\lambda]^{m\times n}\) is regular if \(A\) and \(B\) are square matrices of the same order \(n\), and if the determinant \(|\lambda A-B|\) is not identically 0. Otherwise, the pencil is called singular.
Gracia, Juan-Miguel, de Elguea, Lourdes Ortiz, Sodupe, María-José   +2 more
openaire   +1 more source

Eliminating Impulse for Descriptor System by Derivative Output Feedback

Journal of Applied Mathematics, 2014
The problem of impulse elimination for descriptor system by derivative output feedback is investigated in this paper. Based on a novelly restricted system equivalence between matrix pencils, the range of dynamical order of the resultant closed loop ...
Jian Li, Yufa Teng, Qingling Zhang, Jinghao Li, Liang Qiao   +4 more
doaj   +1 more source

Simplest miniversal deformations of matrices, matrix pencils, and contragredient matrix pencils

Linear Algebra and its Applications, 1999
V. I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a simple normal form for a family of complex n-by-n matrices that smoothly depend on parameters with respect to similarity transformations that smoothly depend on the same parameters. We construct analogous normal forms for a family of real matrices and a family of matrix pencils that
Isabel Garcı́a-Planas, M., Sergeichuk, Vladimir V.   +1 more
openaire   +3 more sources

On the Nearest Singular Matrix Pencil [PDF]

SIAM Journal on Matrix Analysis and Applications, 2017
Summary: Given a regular matrix pencil \(A + \mu E\), we consider the problem of determining the nearest singular matrix pencil with respect to the Frobenius norm. We present new approaches based on the solution of matrix differential equations for determining the nearest singular pencil \(A + \Delta A +\mu( E + \Delta E)\): one approach for general ...
Guglielmi, N., and Lubich, C., and Mehrmann, V.   +2 more
openaire   +3 more sources