Related papers: Analytical Solution for the Generalized Fermat-Tor…
We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…
In this paper we present a convergence analysis for the Nystrom method proposed in [Jour. Comput. Phys. 169 pp. 2921-2934, 2001] for the solution of the combined boundary integral equation formulations of sound-soft acoustic scattering…
The problem of the mean-square optimal linear estimation of the functional $A\xi=\ \int\limits_{R^s}a(t)\xi(-t)dt,$ which depends on the unknown values of stochastic stationary process $\xi(t)$ from observations of the process…
For a field $\mathbb{F}$, what are all functions $f \colon \mathbb{F} \rightarrow \mathbb{F}$ that satisfy the functional equation $f \left( (x+y)/(x-y) \right) = (f(x) + f(y))/(f(x) - f(y))$ for all $ x \neq y$ in $\mathbb{F}$? We solve…
An explicit solution for the generating functional of n-point functions in the planar approximation is given in terms of two sets of free-algebraic annihilation and creation operators.
We provide the general solution of problems concerning AC star circuits by turning them into geometric problems. We show that one problem is strongly related to the Fermat-point of a triangle. We present a solution that is well adapted to…
Two approaches for the efficient rational approximation of the Fermi-Dirac function are discussed: one uses the contour integral representation and conformal mapping and the other is based on a version of the multipole representation of the…
We construct an explicit solution for the multimarginal transportation problem on the unit cube $[0,1]^3$ with the cost function $xyz$ and one-dimensional uniform projections. We show that the primal problem is concentrated on a set with…
In this paper, we study a fractional-order variant of the asymptotical regularization method, called {\it Fractional Asymptotical Regularization (FAR)}, for solving linear ill-posed operator equations in a Hilbert space setting. We assign…
Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
The paper concerns the existence of normalized solutions to a large class of quasilinear problems, including the well-known Born-Infeld operator. In the mass subcritical cases, we study a global minimization problem and obtain a ground…
In this paper, we discuss an approximation strategy for solving the Linear Quadratic Tracking that is both forward and local in time. We exploit the known form of the value function along with a time reversal transformation that nicely…
This paper introduces a novel algorithmic solution for the approximation of a given multivariate function by a nomographic function that is composed of a one-dimensional continuous and monotone outer function and a sum of univariate…
We consider a general optimization problem of minimizing a composite objective functional defined over a class of probability distributions. The objective is composed of two functionals: one is assumed to possess the variational…
Factor Analysis is a widely used modeling technique for stationary time series which achieves dimensionality reduction by revealing a hidden low-rank plus sparse structure of the covariance matrix. Such an idea of parsimonious modeling has…
We give a simple approximation algorithm for a common generalization of many previously studied extensions of the maximum size stable matching problem with ties. These generalizations include the existence of critical vertices in the graph,…
On the basis of the generalized argument principle, here we develop a numerical scheme for locating zeros and poles of a meromorphic function. A subdivision-transformation-calculation scheme is proposed to ensure the algorithm stability. A…
A new method of root finding is formulated that uses a numerical iterative process involving three points. A given function y = f(x) whose roots are desired is fitted and approximated by a polynomial function of the form P(x)= a(x-b)^N that…
A method for finding the general solution to the partial differential equations: \ $F(u_x,u_y)=0$; \ $F(f(x)\:u_x,u_y)=0$ \ (or \ $F(u_x,h(y)\:u_y)=0$) \ is presented, founded on a Legendre like transformation and a theorem for Pfaffian…