English
Related papers

Related papers: 3rd-order Spectral Representation Method: Part I -…

200 papers

First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored…

Machine Learning · Statistics 2017-12-01 Naman Agarwal , Brian Bullins , Elad Hazan

This paper proposes a method to reconstruct the neural radiance field with equirectangular omnidirectional images. Implicit neural scene representation with a radiance field can reconstruct the 3D shape of a scene continuously within a…

Computer Vision and Pattern Recognition · Computer Science 2022-08-15 Qiaoge Li , Itsuki Ueda , Chun Xie , Hidehiko Shishido , Itaru Kitahara

Recently, we have proposed a new diffusive representation for fractional derivatives and, based on this representation, suggested an algorithm for their numerical computation. From the construction of the algorithm, it is immediately…

Numerical Analysis · Mathematics 2022-04-12 Kai Diethelm

Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…

An overview of computational methods to describe high-dimensional potential energy surfaces suitable for atomistic simulations is given. Particular emphasis is put on accuracy, computability, transferability and extensibility of the methods…

Chemical Physics · Physics 2020-07-08 Oliver T. Unke , Debasish Koner , Sarbani Patra , Silvan Käser , Markus Meuwly

Particle-based representations of radiance fields such as 3D Gaussian Splatting have found great success for reconstructing and re-rendering of complex scenes. Most existing methods render particles via rasterization, projecting them to…

Measurement and estimation of parameters are essential for science and engineering, where the main quest is to find out the highest achievable precision with given resources and design schemes to attain it. Two schemes, the sequential…

Quantum Physics · Physics 2016-11-03 Haidong Yuan

We present a review of recent developments of simulations of the Vlasov-Maxwell system of equations using a Fourier transform method in velocity space. In this method, the distribution functions for electrons and ions are Fourier…

Plasma Physics · Physics 2011-07-26 Bengt Eliasson

Given the necessity of connecting the unconnected, covering blind spots has emerged as a critical task in the next-generation wireless communication network. A direct solution involves obtaining a coverage manifold that visually showcases…

Networking and Internet Architecture · Computer Science 2023-12-12 Ruibo Wang , Washim Uddin Mondal , Mustafa A. Kishk , Vaneet Aggarwal , Mohamed-Slim Alouini

We address the problem of estimating the spherical-harmonic power spectrum of a statistically isotropic scalar signal from noise-contaminated data on a region of the unit sphere. Three different methods of spectral estimation are…

Astrophysics · Physics 2009-11-13 F. A. Dahlen , Frederik J Simons

For a weakly coupled quantum field at high temperature the classical approximation offers a possibility to gain insight into nonperturbative real-time dynamics. I use this to present a nonperturbative approach to the computation of spectral…

High Energy Physics - Lattice · Physics 2015-06-25 Gert Aarts

We introduce a simple representation for isotropic spherical random fields and we discuss how it allows to discuss different notions of sparsity under isotropy. We also show how a suitable construction of sparse fields can mimic well the…

Probability · Mathematics 2026-01-30 Giacomo Greco , Domenico Marinucci

Uncertainty quantification techniques such as the time-dependent generalized polynomial chaos (TD-gPC) use an adaptive orthogonal basis to better represent the stochastic part of the solution space (aka random function space) in time.…

Numerical Analysis · Mathematics 2022-07-22 Hugo Esquivel , Arun Prakash , Guang Lin

We present a new computationally efficient method for multi-beamforming in the broadband setting. Our "fast beamspace transformation" forms $B$ beams from $M$ sensor outputs using a number of operations per sample that scales linearly (to…

Signal Processing · Electrical Eng. & Systems 2026-04-17 Nakul Singh , Coleman DeLude , Mark Davenport , Justin Romberg

The efficient simulation of isotropic Gaussian random fields on the unit sphere is a task encountered frequently in numerical applications. A fast algorithm based on Markov properties and fast Fourier Transforms in 1d is presented that…

Numerical Analysis · Mathematics 2018-04-16 Peter E. Creasey , Annika Lang

We propose a novel cross-spectral rendering framework based on 3D Gaussian Splatting (3DGS) that generates realistic and semantically meaningful splats from registered multi-view spectrum and segmentation maps. This extension enhances the…

Computer Vision and Pattern Recognition · Computer Science 2024-08-14 Saptarshi Neil Sinha , Holger Graf , Michael Weinmann

Two methods for fast Fourier transforms are used in a quantum context. The first method is for systems with dimension of the Hilbert space $D=d^n$ with $d$ an odd integer, and is inspired by the Cooley-Tukey formalism. The `large Fourier…

Quantum Physics · Physics 2024-05-09 C. Lei , A. Vourdas

This paper proposes a novel computationally efficient dynamic bi-orthogonality based approach for calibration of a computer simulator with high dimensional parametric and model structure uncertainty. The proposed method is based on a…

Computation · Statistics 2012-11-14 Piyush Tagade , Han-Lim Choi

This note presents a rigorous introduction to a selection of distributions along with their Fourier transforms, which are commonly encountered in signal processing and, in particular, magnetic resonance imaging (MRI). In contrast to many…

Functional Analysis · Mathematics 2025-06-24 Kaibo Tang

Kernel-based methods are heavily used in machine learning. However, they suffer from $O(N^2)$ complexity in the number $N$ of considered data points. In this paper, we propose an approximation procedure, which reduces this complexity to…

Numerical Analysis · Mathematics 2024-11-20 Johannes Hertrich