Related papers: The inversion problem for rational B\'ezier curves
When an inverse problem is solved by a gradient-based optimization algorithm, the corresponding forward and adjoint problems, which are introduced to compute the gradient, can be also solved iteratively. The idea of iterating at the same…
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…
In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for physicists dealing, for instance, with optimization problems, with data analysis, with the…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
We consider an inverse problem for the Boltzmann equation with nonlinear collision operator in dimensions $n\geq 2$. We show that the kinetic collision kernel can be uniquely determined from the incoming-to-outgoing mappings on the boundary…
A new method for solving inverse spectral problems on quantum star graphs is proposed. The method is based on Neumann series of Bessel functions representations for solutions of Sturm-Liouville equations. The representations admit estimates…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Block Toeplitz matrices, using only matrix-vector products, and with a complexity of…
We consider matrix functions with certain invariance under inversion in the unit circle. If such a function satisfies a positivity assumption on the unit circle, then only zero partial indices appear in its Riemann-Hilbert (Wiener-Hopf)…
We study parameterisation-independent closed planar curve matching as a Bayesian inverse problem. The motion of the curve is modelled via a curve on the diffeomorphism group acting on the ambient space, leading to a large deformation…
In this paper we consider a twofold Ellis-Gohberg type inverse problem in an abstract *-algebraic setting. Under natural assumptions, necessary and sufficient conditions for the existence of a solution are obtained, and it is shown that in…
In this paper, first a great number of inverse problems which arise in instrumentation, in computer imaging systems and in computer vision are presented. Then a common general forward modeling for them is given and the corresponding…
A variety of boundary value problems in linear transport theory are expressed as a diffusion equation of the two-way, or forward-backward, type. In such problems boundary data are specified only on part of the boundary, which introduces…
It is believed that some numerical technique must be employed for the determination of the system parameters of a visual binary or a star with a planet because the relevant equations are not only highly nonlinear but also transcendental…
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…
This article is written with the hope to draw attention to a method that uses integral transforms to find exact values for a large class of convergent series (and, in particular, series of rational terms). We apply the method to some series…
To construct a curve with a monotonic curvature (spiral), and given tangents and curvatures at the ends, the author proposed the following method. From given boundary conditions, the values of two inverse invariants are determined. Then, on…
The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
We present an alternative way of solving the steerable kernel constraint that appears in the design of steerable equivariant convolutional neural networks. We find explicit real and complex bases which are ready to use, for different…