Related papers: A new multidimensional slow continued fraction alg…
This article presents the extension of the one-dimensional Stoney algorithm to a two-dimensional case. The proposed extension consists in modifying the method of curvature estimation. The surface profile of the wafer before deposition of…
We accelerate the computation of spherical harmonic transforms, using what is known as the butterfly scheme. This provides a convenient alternative to the approach taken in the second paper from this series on "Fast algorithms for spherical…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the…
We examine convergence properties of continuous-time variants of accelerated Forward-Backward (FB) and Douglas-Rachford (DR) splitting algorithms for nonsmooth composite optimization problems. When the objective function is given by the sum…
We present an algorithm that covers any given rational ruled surface with two rational parametrizations. In addition, we present an algorithm that transforms any rational surface parametrization into a new rational surface parametrization…
The sliding square model is a widely used abstraction for studying self-reconfigurable robotic systems, where modules are square-shaped robots that move by sliding or rotating over one another. In this paper, we propose a novel distributed…
The problem of Bayesian filtering and smoothing in nonlinear models with additive noise is an active area of research. Classical Taylor series as well as more recent sigma-point based methods are two well-known strategies to deal with these…
We analyze the problem of fitting a fonction en escalier or multi-step function to a curve in L^2 Hilbert space. We propose a two-stage optimization approach whereby the step positions are initially fixed, corresponding to a classic linear…
We discuss complex Farey graphs for the Euclidean imaginary quadratic number fields $\mathbb Q(\sqrt{-d})$, $d\in\{1, 2, 3, 7, 11\}$. We study hyperbolic versions of A. Schmidt's Farey polygons living in $3$-dimensional hyperbolic space…
This paper considers the robust ${\cal D}$-stability margin problem under polynomic structured real parametric uncertainty. Based on the work of De Gaston and Safonov (1988), we have developed techniques such as, a parallel frequency…
We introduce differentiable indirection -- a novel learned primitive that employs differentiable multi-scale lookup tables as an effective substitute for traditional compute and data operations across the graphics pipeline. We demonstrate…
The design of isophoric phased arrays composed of two-sized square-shaped tiles that fully cover rectangular apertures is dealt with. The number and the positions of the tiles within the array aperture are optimized to fit desired…
One of the major challenges of employing a dual-frequency phase-shifting algorithm for phase retrieval is its sensitivity to noise. Yun et. al [H Yun, B Li, S Zhang. 2017] proposed a dual-frequency method based on the Fourier transform…
Let A_0, A_1 be nonnegative matrices in GL(n+1,Z) such that the subsimplexes A_0[Delta], A_1[Delta] split the standard unit n-dimensional simplex Delta in two. We prove that, for every n=1,2,... and up to the natural action of the symmetric…
We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve…
Recently a deterministic method, frequent directions (FD) is proposed to solve the high dimensional low rank approximation problem. It works well in practice, but experiences high computational cost. In this paper, we establish a fast…
We develop a new method for equality constrained optimization problems based on a sequential cubic programming framework. Each iteration utilizes a step decomposition based on the Jacobian of the constraints into a normal and a tangential…
We analyze several generic proximal splitting algorithms well suited for large-scale convex nonsmooth optimization. We derive sublinear and linear convergence results with new rates on the function value suboptimality or distance to the…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.