Related papers: Initial guesses for multi-shift solvers
Change-point detection methods are proposed for the case of temporary failures, or transient changes, when an unexpected disorder is ultimately followed by a readjustment and return to the initial state. A base distribution of the…
A convergent iterative process is constructed for solving any solvable linear equation in a Hilbert space.
The shift design and the personnel scheduling problem is known to be a difficult problem. It is a real-world problem which has lots of applications in the organization of companies. Solutions are usually found by dividing the problem in two…
This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…
We formulate a variational fictitious-time flow which drives an initial guess torus to a torus invariant under given dynamics. The method is general and applies in principle to continuous time flows and discrete time maps in arbitrary…
Convergence results are stated for the variational iteration method applied to solve an initial value problem for a system of ordinary differential equations.
In this paper, two efficient iterative algorithms based on the simpler GMRES method are proposed for solving shifted linear systems. To make full use of the shifted structure, the proposed algorithms utilizing the deflated restarting…
Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…
In this paper, we introduce an iterative numerical method to solve systems of nonlinear equations. The third-order convergence of this method is analyzed. Several examples are given to illustrate the efficiency of the proposed method.
Complementarity problems often permit distinct solutions, a fact of major significance in optimization, game theory and other fields. In this paper, we develop a numerical technique for computing multiple isolated solutions of…
We propose a method for variable selection in multiple regression with random predictors. This method is based on a criterion that permits to reduce the variable selection problem to a problem of estimating suitable permutation and…
We consider the problem of inference in shift-share research designs. The choice between existing approaches that allow for unrestricted spatial correlation involves tradeoffs, varying in terms of their validity when there are relatively…
This paper is about GMRES algorithms for the solution of nonsingular linear systems. We first consider basic algorithms and study their convergence. We then focus on acceleration strategies and parallel algorithms that are useful for…
This paper proposes a new framework for constructing interval-valued state estimators for discrete-time linear and switched linear systems. Our main results are (i) the derivation of the tightest interval-valued estimator for linear…
We present an acceleration method for sequences of large-scale linear systems, such as the ones arising from the numerical solution of time-dependent partial differential equations coupled with algebraic constraints. We discuss different…
The concept of sequential choice functions is introduced and studied. This concept applies to the reduction of the problem of stable matchings with sequential workers to a situation where the workers are linear.
In this paper we consider interpolation problem connected with series by integer shifts of Gaussians. Known approaches for these problems met numerical difficulties. Due to it another method is considered based on finite-rank approximations…
It is well known that the Newton method may not converge when the initial guess does not belong to a specific quadratic convergence region. We propose a family of new variants of the Newton method with the potential advantage of having a…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
We present a method for solving a class of initial valued, coupled, non-linear differential equations with `moving singularities' subject to some subsidiary conditions. We show that this type of singularities can be adequately treated by…