Related papers: Global solutions of approximation problems in Krei…
A $J$-frame is a frame $\mathcal{F}$ for a Krein space $(\mathcal{H}, [\, , \,])$ which is compatible with the indefinite inner product $[\, , \, ]$ in the sense that it induces an indefinite reconstruction formula that resembles those…
We show that solutions to Krein systems, the continuous frequency analogue of orthogonal polynomials on the unit circle, generated by an $A_2 (\mathbb{R})$ weight $w$ satisfying $w-1 \in L^1 (\mathbb{R}) + L^2 (\mathbb{R})$, are uniformly…
An indefinite variant of the abstract interpolation problem is considered. Associated to this problem is a model Pontryagin space isometric operator V. All the solutions of the problem are shown to be in a one-to-one correspondence with a…
In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g. the Helmholtz…
We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we…
In this article we find a necessary and sufficient condition under which a given collection of subspace is a $J$-fusion frame for a Krein space $\mathbb{K}$. We also approximate $J$-fusion frame bounds of a $J$-fusion frame by the upper and…
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is…
We solve the problem of counting elliptic curves with fixed j-invariant in projective space with tangency conditions. This is equivalent to couting rational nodal curves with condition on the node of the image. The solution is given in the…
The inverse problem of antiplane elasticity on determination of the profiles of $n$ uniformly stressed inclusions is studied. The inclusions are in ideal contact with the surrounding matrix, the stress field inside the inclusions is…
This paper introduces a new class of algorithms for solving large-scale linear inverse problems based on new flexible and inexact Golub-Kahan factorizations. The proposed methods iteratively compute regularized solutions by approximating a…
In this work, we apply two meshless methods for the numerical solution of the time-dependent transport equation defined on the sphere in spherical coordinates. The first technique, which was introduced by Mirzaei (BIT Numerical Mathematics,…
For solving a wide class of nonconvex and nonsmooth problems, we propose a proximal linearized iteratively reweighted least squares (PL-IRLS) algorithm. We first approximate the original problem by smoothing methods, and second write the…
Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on…
Various norms can be defined on a Krein space by choosing different underlying fundamental decompositions. Some estimates of norms on Krein spaces are discussed and few results in Bognar's paper are generalized.
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
We revisit the matrix problems sparse null space and matrix sparsification, and show that they are equivalent. We then proceed to seek algorithms for these problems: We prove the hardness of approximation of these problems, and also give a…
In recent years two Krylov subspace methods have been proposed for solving skew symmetric linear systems, one based on the minimum residual condition, the other on the Galerkin condition. We give new, algorithm-independent proofs that in…
We describe the Krein extension of minimal operator associated with the expression A:=(-1)^n*d^(2n)/dx^(2n) on a finite interval (a,b) in terms of boundary conditions. All non-negative extensions of the operator A as well as extensions with…
When a solution to an abstract inverse linear problem on Hilbert space is approximable by finite linear combinations of vectors from the cyclic subspace associated with the datum and with the linear operator of the problem, the solution is…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…