Results 231 to 240 of about 123,227 (279)
Some of the next articles are maybe not open access.

Invariant subspace method for eigenvalue computation

IEEE Transactions on Power Systems, 1993
Methods which first subdivide a large power system into subsystems, and which then study how the interactions between subsystems cause the eigenvalues and eigenvectors to vary between the subsystems and the total system are presented. The invariant subspace method, which allows eigenvalues that are difficult to study individually to be grouped into a ...
D.J. Stadnicki, J.E. Van Ness
openaire   +1 more source

Linear-quadratic mean field control: The invariant subspace method

Automatica, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiang, Huang, Minyi
openaire   +1 more source

Kernel-based invariant subspace method for hyperspectral target detection

2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004
In this paper, a kernel-based invariant subspace detection method is proposed for small target detection of hyperspectral images. The method combines kernel principal component analysis (KPCA) and the linear mixture model (LMM). The LMM is used to describe each pixel in the hyper-spectral image as a mixture of target, background and noise.
null Ye Zhang, null Yanfeng Gu
openaire   +1 more source

A Supervised Low-Rank Method for Learning Invariant Subspaces

2015 IEEE International Conference on Computer Vision (ICCV), 2015
Sparse representation and low-rank matrix decomposition approaches have been successfully applied to several computer vision problems. They build a generative representation of the data, which often requires complex training as well as testing to be robust against data variations induced by nuisance factors.
Farzad Siyahjani   +3 more
openaire   +1 more source

4. Structured Invariant Subspace Methods

2011
The numerical solution of an algebraic Riccati equation can be reduced to the computation of an invariant subspace of a suitable matrix or a deflating subspace of a suitable pencil.
Dario Andrea Bini   +2 more
openaire   +2 more sources

Sensitivity eigenanalysis for single shift-invariant subspace-based methods

Signal Processing, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Convergence of the Newton--Kantorovich Method for Calculating Invariant Subspaces

Mathematical Notes, 2004
We propose a version of the Newton--Kantorovich method which, given a nondegenerate square n X n matrix and a number ...
Yu. M. Nechepurenko, M. Sadkane
openaire   +1 more source

An invariant subspace method for large-scale algebraic Riccati equation

Applied Numerical Mathematics, 2010
The linear time-invariant dynamical system \[ \begin{cases} \dot x(t) = Ax(t) + Bu(t),\quad x(0)=x_0,\\ y(t) ~=~ Cx(t), \end{cases} \tag{S} \] where \(A\), \(B\), \(C\) are matrices, is considered. In practice the square matrix \(A\) is \(n \times n\), and \(n\) is very large (of the order \(10^5\) or \(10^6\)).
Amodei, Luca, Buchot, Jean-Marie
openaire   +3 more sources

Three methods for refining estimates of invariant subspaces

Computing, 1987
We compare three methods for refining estimates of invariant subspaces, due to \textit{F. Chatelin} [Comput. Suppl. 5, 67-74 (1984; Zbl 0555.65023)], \textit{J. Dongarra}, \textit{C. Moler} and \textit{J. Wilkinsons} [SIAM J. Numer. Anal. 20, 23-45 (1983; Zbl 0523.65021)] and \textit{G. Stewart} [SIAM Rev. 15, 727-764 (1973; Zbl 0297.65030)].
openaire   +1 more source

The Invariant Subspace Method for Solving Fractional Partial Differential Equations

2020
In this chapter, the authors discuss the effectiveness of the invariant subspace method (ISM) for solving fractional partial differential equations. For this purpose, they have chosen a nonlinear time fractional partial differential equation (PDE) with variable coefficients to be investigated through this method.
Mohamed Soror Abdel Latif   +1 more
openaire   +1 more source

Home - About - Disclaimer - Privacy