Results 1 to 10 of about 11,250,600 (290)
Combined invariant subspace & frequency-domain subspace method for identification of discrete-time MIMO linear systems [PDF]
Systems and Control Letters, 2023 Recently, a novel system identification method based on invariant subspace theory is introduced, aiming to address the identification problem of continuous-time (CT) linear time-invariant (LTI) systems by combining time-domain and frequency-domain methods.
Jingze You +2 more
exaly +6 more sources
Speed invariant gait recognition-The enhanced mutual subspace method.
PLoS ONE, 2021 This paper introduces an enhanced MSM (Mutual Subspace Method) methodology for gait recognition, to provide robustness to variations in walking speed.
Yumi Iwashita +3 more
doaj +5 more sources
A refined invariant subspace method and applications to evolution equations [PDF]
Science China Mathematics, 2012 The invariant subspace method is refined to present more unity and more diversity of exact solutions to evolution equations. The key idea is to take subspaces of solutions to linear ordinary differential equations as invariant subspaces that evolution equations admit.
Wen-Xiu Ma
exaly +4 more sources
Invariant Subspace Method: A Tool for Solving Fractional Partial Differential Equations [PDF]
Fractional Calculus and Applied Analysis, 2017 In this paper invariant subspace method has been employed for solving linear and non-linear fractional partial differential equations involving Caputo derivative. A variety of illustrative examples are solved to demonstrate the effectiveness and applicability of the method.
Sangita Choudhary +1 more
exaly +3 more sources
Frontiers in Physics, 2023 We extend the invariant subspace method (ISM) to a class of Hamilton–Jacobi equations (HJEs) and a family of third-order time-fractional dispersive PDEs with the Caputo fractional derivative in this letter.
Gaizhu Qu, Mengmeng Wang, Shoufeng Shen
doaj +3 more sources
A new method for computing the stable invariant subspace of a real Hamiltonian matrix
Journal of Computational and Applied Mathematics, 1997 The problem of the numerical computation of the Lagrangian invariant subspaces of a real Hamiltonian matrix with a strongly backward stable algorithm is thoroughly examined. The solution of the Hamiltonian eigenvalue problem is important because of its close relation with the solution of the continuous-time algebraic Riccati equation.
Volker Mehrmann, Peter Benner
exaly +3 more sources
Communications in Nonlinear Science and Numerical Simulation, 2022 In this paper, we generalize the theory of the invariant subspace method to (m + 1)-dimensional non-linear time-fractional partial differential equations for the first time. More specifically, the applicability and efficacy of the method have been systematically investigated through the (3 + 1)-dimensional generalized non-linear time-fractional ...
Lakshmanan Muthusamy, P Prakash
exaly +5 more sources
On the Invariant Subspace Method for Nonlinear Second-Order Evolution Equations
MathematicsWe investigate invariant finite-dimensional linear spaces for a class of nonlinear evolution equations with second-order time dependence of the type ∂ttu=−∂x(A(x,u)u)+∂xx(B(x,u)u)+f(u), where the coefficients may depend nonlinearly on the solution. Using
Manal Badgaish +2 more
doaj +2 more sources
Optimizing option pricing: Exact and approximate solutions for the time-fractional Ivancevic model
Alexandria Engineering Journal, 2023 This research investigates the time fractional Ivancevic option pricing model and presents two distinct solution methods: the invariant subspace method for obtaining exact solutions and the residual power series method for generating approximate ...
Khalid K. Ali, M.A. Maaty, M. Maneea
doaj +1 more source
Approximate invariant subspaces and quasi-newton optimization methods [PDF]
Optimization Methods and Software, 2010 New approximate secant equations are shown to result from the knowledge of (problem dependent) invariant subspace information, which in turn suggests improvements in quasi-Newton methods for unconstrained minimization. A new limited-memory Broyden-Fletcher-Goldfarb-Shanno using approximate secant equations is then derived and its encouraging behaviour ...
Gratton, Serge +1 more
openaire +2 more sources