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,657 papers · 148 categories

Trend · papers per month

92184275367 · Jun 202019922001200920172026
48 results for linear elasticity

Study on elasticity with mixed boundary conditions, proving spectral asymptotics.

problem Analyzing spectral asymptotics for linear elasticity with mixed boundary conditions.
method Established two-term spectral asymptotics for linear elasticity on smooth compact manifolds.
result Verification of general formulae through explicit examples in 2D and 3D.

Study of elastic models in non-Euclidean spaces via Γ-convergence.

problem Elasticity in non-Euclidean ambient spaces with incompatible local rest distances.
method Γ-convergence to derive a limit elastic model, relating minimum energy to curvature discrepancy.
result Linearized version of a conjecture in elasticity confirmed, linking energy to curvature.

The spectral asymptotics for linear elasticity with mixed boundary conditions are shown to be old results.

problem Analyzing the spectral asymptotics for linear elasticity with mixed boundary conditions.
method Demonstrating that the results are essentially old well-known results by other authors.
result The spectral asymptotics results for linear elasticity with mixed boundary conditions are shown to be old results by other authors.

A new method for semi-supervised learning of sparse features using elastic-net.

problem Semi-supervised learning of sparse features in generalized linear models.
method Generalized Semi-Supervised Elastic-Net (s2net) framework.
result The s2net framework improves upon supervised elastic-net methods for semi-supervised learning.

Variable selection plays an important role in the high-dimensional data analysis. However the high-dimensional data often induces the strongly correlated variables problem. In this paper, we propose Elastic Net procedure for partially linear models and prove the group effect of its estimate. By a simulation study, we s…

2015-07-22abs ↗pdf ↗

Paper develops algorithms for sparse linear regression with generalized elastic net penalty.

problem Sparse linear regression with robust penalty for high-dimensional data.
method Iterative Reweighted Framework based on ADMM and PMM with SNN.
result Efficient algorithms provide superior performance in both simulated and real data.

We derive a dimensionally-reduced limit theory for an nn-dimensional nonlinear elastic body that is slender along kk dimensions. The starting point is to view an elastic body as an nn-dimensional Riemannian manifold together with a not necessarily isometric W1,2W^{1,2}-immersion in nn-dimensional Euclidean space. The…

2012-01-17abs ↗pdf ↗

In non-linear incompatible elasticity, the configurations are maps from a non-Euclidean body manifold into the ambient Euclidean space, Rk\mathbb{R}^k. We prove the ΓΓ-convergence of elastic energies for configurations of a converging sequence, MnM\mathcal{M}_n\to\mathcal{M}, of body manifolds. This convergence result …

2015-11-07abs ↗pdf ↗

The paper generalizes the Cauchy-Schwarz-Bunyakovsky inequality and applies it to elasticity problems.

problem Applying the Cauchy-Schwarz-Bunyakovsky inequality to elasticity problems.
method Presentation of discrete and integral forms, n-dimensional generalizations, and strengthened CBS inequality.
result The strengthened CBS inequality is crucial for elasticity problems.

We propose a general strategy to derive null-homotopy operators for differential complexes based on the Bernstein-Gelfand-Gelfand (BGG) construction and properties of the de Rham complex. Focusing on the elasticity complex, we derive path integral operators P\mathscr{P} for elasticity satisfying $\mathscr{D}\mathscr{P…

2018-01-22abs ↗pdf ↗

A fast method estimates group-adaptive elastic net penalties using co-data.

problem Computational inefficiency in estimating group-adaptive elastic net penalties.
method Derive low-dimensional representation of Taylor approximation for marginal likelihood and its derivative for group-adaptive ridge penalties; approximate elastic net marginal likelihood by ridge; transform ridge penalties to elastic net penalties.
result Significantly decreases computation time and outperforms other methods.

Enhanced ECCD speeds up elastic net model training.

problem Efficiently solving generalized linear models with elastic net constraints.
method Redesigned cyclic coordinate descent with Taylor expansion and batched computations.
result Empirically shows consistent 3imes3 imes performance improvement over state-of-the-art solvers.

This paper presents a phenomenon in neural networks that we refer to as \textit{local elasticity}. Roughly speaking, a classifier is said to be locally elastic if its prediction at a feature vector $\bx'$ is \textit{not} significantly perturbed, after the classifier is updated via stochastic gradient descent at a (labe…

2019-10-15abs ↗pdf ↗

ARGEN method improves variable selection and regularization in high-dimensional sparse models.

problem Constrained variable selection and regularization in high-dimensional sparse linear models.
method ARGEN penalty method, variable selection and regularization.
result ARGEN method has variable selection and estimation consistency under certain conditions.

Renet improves Elastic Net by dynamically selecting between convex blending and refitting, enhancing prediction accuracy.

problem Elastic Net's shrinkage bias limits its prediction accuracy in high-dimensional settings.
method Adaptive relaxation procedure that dynamically dispatches between convex blending and efficient sub-path refitting.
result Renet consistently outperforms standard Elastic Net and Adaptive Elastic Net in high-dimensional, low signal-to-noise ratio, and high-multicollinearity scenarios.

Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie for the selection of groups of correlated variables. To investigate on the statistical properties of this scheme and in particular on its consistency properties, we set up …

2008-07-22abs ↗pdf ↗

The wave equation utt=c2uxxu_{tt} = c^2 u_{xx} is generally regarded as a linear approximation to the equation describing the amplitude of a transversely vibrating elastic string in the plane. But, as is shown in \cite{BC96}, the assumption of transverse vibration in fact implies that the wave equation describes the vibration…

2013-02-27abs ↗pdf ↗

We minimize a linear combination of the Willmore and the length functional among networks in Rd\mathbb{R}^d belonging to a given class determined by the number of curves, the order of the junctions and the angles between curves at the junctions. Since this class lacks compactness, we characterize the set of limits of s…

2019-09-13abs ↗pdf ↗

We consider an infinite 3-dimensional elastic continuum whose material points experience no displacements, only rotations. This framework is a special case of the Cosserat theory of elasticity. Rotations of material points are described mathematically by attaching to each geometric point an orthonormal basis which give…

2010-08-23abs ↗pdf ↗

The Poisson problem consists in finding an immersed surface ΣRmΣ\subset\mathbb{R}^m minimising Germain's elastic energy (known as Willmore energy in geometry) with prescribed boundary, boundary Gauss map and area which constitutes a non-linear model for the equilibrium state of thin, clamped elastic plates originating f…

2018-07-24abs ↗pdf ↗

The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…

2014-10-22abs ↗pdf ↗

We discuss some differential geometry pertaining to continuum mechanics and the route recently taken by D.N. Arnold, R.S. Falk, and R. Winther in deriving new improved finite element schemes in linear elasticity from constructions in projective geometry.

2010-05-12abs ↗pdf ↗

LIT-LVM improves linear predictors by estimating interaction terms with latent vectors.

problem Accurately estimating coefficients for interaction terms in linear predictors.
method Structured regularization using latent vectors to represent features.
result LIT-LVM achieves superior prediction accuracy compared to other methods.

This paper consider penalized empirical loss minimization of convex loss functions with unknown non-linear target functions. Using the elastic net penalty we establish a finite sample oracle inequality which bounds the loss of our estimator from above with high probability. If the unknown target is linear this inequali…

2013-12-12abs ↗pdf ↗

Paper introduces a new IV regression method for mixed-frequency data.

problem Estimating high-dimensional slope parameters in mixed-frequency data.
method Tikhonov-regularized estimator for high-dimensional linear IV regression.
result High-dimensional slope parameter can be accurately estimated using a low-frequency instrumental variable.

The paper studies rigidity and continuity in nonlinear elasticity on manifolds and hypersurfaces.

problem Rigidity and continuity properties of elastic bodies in non-Euclidean settings.
method Geometric rigidity estimates, asymptotic rigidity of elastic membranes, simplified geometric proof of continuous dependence.
result Established geometric rigidity estimate and proved asymptotic rigidity of elastic membranes.

Study preserves planar and graphical properties of curves under elastic flow.

problem Maintaining planar and graphical properties of non-compact curves under elastic flow.
method Extended recent work on adapted elastic energy to derive thresholds for planar and graphical embeddedness.
result Derived new Li--Yau type inequality for complete planar curves.

A new algorithm computes elastic shape distances between curves efficiently.

problem Computing elastic shape distances between curves in high dimensions.
method Dynamic Programming for optimal diffeomorphisms and Kabsch-Umeyama algorithm for optimal rotation matrices.
result Efficient computation of elastic shape distances with improved efficiency for closed curves.

The paper studies the free elastic flow of closed curves and finds their asymptotic shape converges to a circle.

problem Challenges in studying the asymptotic behavior of the free elastic flow for closed curves.
method Analysis of the free elastic flow as an L2L^2-gradient flow for Euler's elastic energy.
result An appropriate rescaling of initial curves geometrically close to circles converges to a unique round circle.

Motivated by the problem of finding an explicit description of a developable narrow Moebius strip of minimal bending energy, which was first formulated by M. Sadowsky in 1930, we will develop the theory of elastic strips. Recently E.L. Starostin and G.H.M. van der Heijden found a numerical description for an elastic Mo…

2010-01-22abs ↗pdf ↗