Related papers: A novel multi-step method for the partial pole ass…
A multi-step extended maximum residual Kaczmarz method is presented for the solution of the large inconsistent linear system of equations by using the multi-step iterations technique. Theoretical analysis proves the proposed method is…
A sequential piecewise linear programming method is presented where bounded domains of non-convex functions are successively contracted about the solution of a piecewise linear program at each iteration of the algorithm. Although…
The matching problem between two adjacency matrices can be formulated as the NP-hard quadratic assignment problem (QAP). Previous work on semidefinite programming (SDP) relaxations to the QAP have produced solutions that are often tight in…
This paper presents a novel parallel-in-time algorithm able to compute time-periodic solutions of problems where the period is not given. Exploiting the idea of the multiple shooting method, the proposed approach calculates the initial…
Pole-swapping algorithms are generalizations of bulge-chasing algorithms for the generalized eigenvalue problem. Structure-preserving pole-swapping algorithms for the palindromic and alternating eigenvalue problems, which arise in control…
A step-search sequential quadratic programming method is proposed for solving nonlinear equality constrained stochastic optimization problems. It is assumed that constraint function values and derivatives are available, but only stochastic…
The rational QZ method generalizes the QZ method by implicitly supporting rational subspace iteration. In this paper we extend the rational QZ method by introducing shifts and poles of higher multiplicity in the Hessenberg pencil, which is…
In this work we are interested in general linear inverse problems where the corresponding forward problem is solved iteratively using fixed point methods. Then one-shot methods, which iterate at the same time on the forward problem solution…
The indefinite least squares (ILS) problem is a generalization of the famous linear least squares problem. It minimizes an indefinite quadratic form with respect to a signature matrix. For this problem, we first propose an impressively…
Kinetic equations model distributions of particles in position-velocity phase space. Often, one is interested in studying the long-time behavior of particles in high-collisional regimes in which an approximate (advection)-diffusion model…
A new penalty-free neural network method, PFNN-2, is presented for solving partial differential equations, which is a subsequent improvement of our previously proposed PFNN method [1]. PFNN-2 inherits all advantages of PFNN in handling the…
Partially observable Markov decision processes (POMDPs) have recently become popular among many AI researchers because they serve as a natural model for planning under uncertainty. Value iteration is a well-known algorithm for finding…
Within this paper, we introduce and analyze a novel time stepping scheme for linear poroelasticity. In each time frame, we iteratively solve the flow and mechanics equations with an additional damping step for the pressure variable.…
The problem of decoupling a nonsquare state space system by state feedback with singular input transformation is considered. The problem is solved by conducting a finite search for decouplable square systems, appropriately derived from the…
A new multi-objective method for the thesis defence scheduling problem is introduced. The problem involves appointing committees to defences and assigning them to a time slot and room. A multi-objective approach is necessary to provide a…
This work deals with the problem of choosing a time step for the numerical solution of boundary value problems for parabolic equations. The problem solution is derived using the fully implicit scheme, whereas a time step is selected via…
We propose three semi-decoupled algorithms for efficiently solving a four-field thermoporoelastic model. The first two algorithms adopt a sequential strategy: at the initial time step, all variables are computed simultaneously using a…
The main objective of this talk is to develop a matrix pencil approach for the study of an initial value problem of a class of singular linear matrix differential equations whose coefficients are constant matrices. By using matrix pencil…
In practical least squares realization problems, partial information about the pole locations of the dynamical model may be known a priori. Existing techniques for incorporating this prior knowledge, such as prefiltering the given data, are…
A type of adaptive finite element method for the eigenvalue problems is proposed based on the multilevel correction scheme. In this method, adaptive finite element method to solve eigenvalue problems involves solving associated boundary…