Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

6.7%13.3%20.0%26.7% · Feb 199519922001200920172026
48 results for orthogonal coordinates

Method constructs orthogonal curvilinear coordinates in constant curvature spaces.

problem Creating orthogonal coordinates in spaces of constant curvature.
method Modification of Krichever's method for Euclidean space, applied to constant curvature spaces.
result Examples of orthogonal coordinate systems on the sphere and hyperbolic plane constructed.

If one could assume that local coordinates in a Riemannian manifold were orthogonal, then local expressions for differential operators, and curvature computations, would be simplified. It is always possible on 2-manifolds, using geometric normal coordinates or isothermal coordinates. In 1984, Dennis DeTurck and Dean Ya…

2019-09-17abs ↗pdf ↗

We prove that the set of orthogonal separable coordinates on an arbitrary (pseudo-)Riemannian manifold carries a natural structure of a projective variety, equipped with an action of the isometry group. This leads us to propose a new, algebraic geometric approach to the classification of orthogonal separable coordinate…

2015-10-30abs ↗pdf ↗

Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper discretization of conjugate, resp. orthogonal coordinate systems of classical differ…

2003-03-26abs ↗pdf ↗

A method for interpreting SVMs using polynomial kernels, revealing model complexity.

problem Interpreting SVMs built with truncated orthogonal polynomial kernels.
method Orthogonal Representation Contribution Analysis (ORCA) with normalized Orthogonal Kernel Contribution (OKC) indices.
result The method reveals structural aspects of model complexity not captured by predictive accuracy.

Study on diagonal and separating coordinates for symmetric spaces of rank 1.

problem Existence and nonexistence of diagonal and separating coordinates for symmetric spaces of rank 1.
method Generalization of results by Gauduchon and Moroianu, 2020, and analysis of constant sectional curvature and orthogonal separation of variables.
result Diagonal coordinates exist if and only if the symmetric space has constant sectional curvature.

The fundamental tool in the classification of orthogonal coordinate systems in which the Hamilton-Jacobi and other prominent equations can be solved by a separation of variables are second order Killing tensors which satisfy the Nijenhuis integrability conditions. The latter are a system of three non-linear partial dif…

2015-02-26abs ↗pdf ↗

The paper studies steady motions of fibre-reinforced fluids on curved surfaces.

problem Analyzing steady motions of fibre-reinforced fluids on curved surfaces.
method Expressing kinematic equations in terms of the intrinsic Gauss equation and identifying integrable cases.
result Derives a variant of the integrable Tzitzéica equation encoding orthogonal coordinate systems on pseudospherical surfaces.

This paper presents a proof of the existence of standard symplectic coordinates near a set of smooth, orthogonally intersecting symplectic submanifolds. It is a generalization of the standard symplectic neighborhood theorem. Moreover, in the presence of a compact Lie group GG acting symplectically, the coordinates can…

2016-11-08abs ↗pdf ↗

Formula derived for Laplace-Beltrami on Stiefel manifold.

problem Finding Laplace-Beltrami operator on Stiefel manifold.
method Using the general framework of Laplace operators on constraint manifolds, derived the explicit formula in terms of ambient Euclidean coordinates.
result Extended previously known formulas for sphere and special orthogonal group.

We show that the orthogonal separation coordinates on the sphere SnS^n are naturally parametrised by the real version of the Deligne-Mumford-Knudsen moduli space Mˉ0,n+2(R)\bar M_{0,n+2}(R) of stable curves of genus zero with n+2n+2 marked points. We use the combinatorics of Stasheff polytopes tessellating Mˉ0,n+2(R)\bar M_{0,n+2}(R) t…

2013-07-23abs ↗pdf ↗

Study integrable discretizations of cyclic systems with circular coordinate lines.

problem Integrable discretizations of 3D cyclic systems with circular coordinate lines.
method Investigate circle congruences and flat connections in the context of discrete cyclic systems.
result Characterization of circle congruences and existence of certain flat connections.

Conformal Autoencoders infer intrinsic dimensionality and impose invariance.

problem Detecting intrinsic dimensionality and imposing invariance in nonlinear manifold data.
method Imposing orthogonality conditions on latent variables to infer intrinsic dimensionality and build coordinate invariance.
result The method can infer intrinsic dimensionality and build coordinate invariance on submanifolds.

OPT framework improves neural network generalization by learning an orthogonal transformation.

problem Improving neural network generalization.
method Orthogonal over-parameterized training (OPT) framework that minimizes hyperspherical energy.
result OPT framework provably minimizes hyperspherical energy and improves empirical generalization.

LOFT separates subspace rotation and transformation for orthogonal fine-tuning.

problem Conflating subspace rotation and transformation in orthogonal fine-tuning.
method LOFT explicitly separates subspace rotation and transformation, using task-aware support selection.
result LOFT recovers principal-subspace orthogonal adaptation and improves efficiency-performance trade-off.

Geometrically revisits Dupin cyclidic systems using evolving circles and cyclides.

problem Understanding the geometric properties and evolution of Dupin cyclidic systems.
method Evolving initial circles or Dupin cyclides to generate Lamé families of Dupin cyclidic systems in various space forms.
result Lamé families are parallel surfaces in different space forms.

We orthogonalize the NSS model to condition and diagnose its ill-conditioned parameters.

problem The ill-conditioning of the NSS model's design matrix.
method Exact orthogonal reparametrization via QR decomposition.
result Orthogonalization isolates the conditioning structure and maintains fit uncertainty.

Bayesian SPCA method tackles orthogonality constraint with spike and slab prior.

problem Bayesian SPCA method for high-dimensional data with orthogonality constraint.
method Parameter-expanded coordinate ascent variational inference (PX-CAVI) with spike and slab prior.
result PX-CAVI algorithm outperforms existing SPCA approaches in performance.

Integrable Killing tensors are used to classify orthogonal coordinates in which the classical Hamilton-Jacobi equation can be solved by a separation of variables. We completely solve the Nijenhuis integrability conditions for Killing tensors on the sphere S3S^3 and give a set of isometry invariants for the integrabilit…

2012-05-28abs ↗pdf ↗

On a constraint manifold we give an explicit formula for the Hessian matrix of a cost function that involves the Hessian matrix of a prolonged function and the Hessian matrices of the constraint functions. We give an explicit formula for the case of the orthogonal group O(n){\bf O}(n) by using only Euclidean coordinates …

2014-03-17abs ↗pdf ↗

Conservation laws, heirarchies, scattering theory and Bäcklund transformations are known to be the building blocks of integrable partial differential equations. We identify these as facets of a theory of Poisson group actions, and apply the theory to the ZS-AKNS nxn heirarchy (which includes the non-linear Schrödinger …

1997-07-07abs ↗pdf ↗

We show that an embedded minimal annulus Σ2B3Σ^2 \subset B^3 which intersects B3\partial B^3 orthogonally and is invariant under reflection through the coordinate planes is the critical catenoid. The proof uses nodal domain arguments and a characterization, due to Fraser and Schoen, of the critical catenoid as the unique…

2016-03-14abs ↗pdf ↗

Spectral dimensionality reduction algorithms are widely used in numerous domains, including for recognition, segmentation, tracking and visualization. However, despite their popularity, these algorithms suffer from a major limitation known as the "repeated Eigen-directions" phenomenon. That is, many of the embedding co…

2016-12-11abs ↗pdf ↗

This paper aims to systematically and comprehensively initiate a foundation for using concepts from computational differential geometry as instruments for power flow computing and research. At this point we focus our discussion on the static case, with power flow equations given by quadratic functions defined on voltag…

2019-03-26abs ↗pdf ↗

In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of …

2011-06-14abs ↗pdf ↗