Spectral method

Numerical analysis | Numerical differential equations

Spectral methods are a class of techniques used in applied mathematics and scientific computing to numerically solve certain differential equations. The idea is to write the solution of the differential equation as a sum of certain "basis functions" (for example, as a Fourier series which is a sum of sinusoids) and then to choose the coefficients in the sum in order to satisfy the differential equation as well as possible. Spectral methods and finite element methods are closely related and built on the same ideas; the main difference between them is that spectral methods use basis functions that are generally nonzero over the whole domain, while finite element methods use basis functions that are nonzero only on small subdomains (compact support). Consequently, spectral methods connect variables globally while finite elements do so locally. Partially for this reason, spectral methods have excellent error properties, with the so-called "exponential convergence" being the fastest possible, when the solution is smooth. However, there are no known three-dimensional single domain spectral shock capturing results (shock waves are not smooth). In the finite element community, a method where the degree of the elements is very high or increases as the grid parameter h increases is sometimes called a spectral element method. Spectral methods can be used to solve differential equations (PDEs, ODEs, eigenvalue, etc) and optimization problems. When applying spectral methods to time-dependent PDEs, the solution is typically written as a sum of basis functions with time-dependent coefficients; substituting this in the PDE yields a system of ODEs in the coefficients which can be solved using any numerical method for ODEs. Eigenvalue problems for ODEs are similarly converted to matrix eigenvalue problems. Spectral methods were developed in a long series of papers by Steven Orszag starting in 1969 including, but not limited to, Fourier series methods for periodic geometry problems, polynomial spectral methods for finite and unbounded geometry problems, pseudospectral methods for highly nonlinear problems, and spectral iteration methods for fast solution of steady-state problems. The implementation of the spectral method is normally accomplished either with collocation or a Galerkin or a approach . For very small problems, the spectral method is unique that solutions may be written out symbolically, yielding a practical alternative to series solutions for differential equations. Spectral methods can be computationally less expensive and easier to implement than finite element methods; they shine best when high accuracy is sought in simple domains with smooth solutions. However, because of their global nature, the matrices associated with step computation are dense and computational efficiency will quickly suffer when there are many degrees of freedom (with some exceptions, for example if matrix applications can be written as Fourier transforms). For larger problems and nonsmooth solutions, finite elements will generally work better due to sparse matrices and better modelling of discontinuities and sharp bends. (Wikipedia).

Ana Romero: Effective computation of spectral systems and relation with multi-parameter persistence

Title: Effective computation of spectral systems and their relation with multi-parameter persistence Abstract: Spectral systems are a useful tool in Computational Algebraic Topology that provide topological information on spaces with generalized filtrations over a poset and generalize the

From playlist AATRN 2022

Eyal Lubetzky - 1/3 Spectral vs. geometric approaches to random walks on random graphs

From playlist Spectral properties of large random objects - Summer school 2017

FFT based spectral Ewald methods as an alternative to multipole methods – A.-K. Tornberg – ICM2018

Numerical Analysis and Scientific Computing Invited Lecture 15.5 FFT based spectral Ewald methods as an alternative to fast multipole methods Anna-Karin Tornberg Abstract: In this paper, we review a set of fast and spectrally accurate methods for rapid evaluation of three dimensional ele

From playlist Numerical Analysis and Scientific Computing

Spectral Sequences 02: Spectral Sequence of a Filtered Complex

I like Ivan Mirovic's Course notes. http://people.math.umass.edu/~mirkovic/A.COURSE.notes/3.HomologicalAlgebra/HA/2.Spring06/C.pdf Also, Ravi Vakil's Foundations of Algebraic Geometry and the Stacks Project do this well as well.

From playlist Spectral Sequences

Teach Astronomy - Chemical Composition

http://www.teachastronomy.com/ Spectroscopy is the key to chemical composition to determining what a star is actually made of. There are two issues. One is detecting the presence of an element, and the second is the amount of that element. The presence of an element is determined by mea

From playlist 14. Stars

Stefan Schwede: Equivariant stable homotopy - Lecture 2

I will use the orthogonal spectrum model to introduce the tensor triangulated category of genuine G-spectra, for compact Lie groups G. I will explain structural properties such as the smash product of G-spectra, and functors relating the categories for varying G (fixed points, geometric fi

From playlist Summer School: Spectral methods in algebra, geometry, and topology

Parametric vs Nonparametric Spectrum Estimation

http://AllSignalProcessing.com for more great signal-processing content: ad-free videos, concept/screenshot files, quizzes, MATLAB and data files. Introduces parametric (model-based) and nonparametric (Fourier-based) approaches to estimation of the power spectrum.

From playlist Estimation and Detection Theory

Elba Garcia-Failde - Quantisation of Spectral Curves of Arbitrary Rank and Genus via (...)

The topological recursion is a ubiquitous procedure that associates to some initial data called spectral curve, consisting of a Riemann surface and some extra data, a doubly indexed family of differentials on the curve, which often encode some enumerative geometric information, such as vol

From playlist Workshop on Quantum Geometry

Nexus Trimester - Sewoong Oh (UIUC)

Near-optimal message-passing algorithms for crowdsourcing Sewoong Oh (UIUC) March 17, 2016 Abstract: Crowdsourcing systems, like Amazon Mechanical Turk, provide platforms where large-scale projects are broken into small tasks that are electronically distributed to numerous on-demand cont

From playlist 2016-T1 - Nexus of Information and Computation Theory - CEB Trimester

Simplicity of Spectral Edges and Applications to Homogenization by Vivek Tewary

PROGRAM: MULTI-SCALE ANALYSIS AND THEORY OF HOMOGENIZATION ORGANIZERS: Patrizia Donato, Editha Jose, Akambadath Nandakumaran and Daniel Onofrei DATE: 26 August 2019 to 06 September 2019 VENUE: Madhava Lecture Hall, ICTS, Bangalore Homogenization is a mathematical procedure to understa

From playlist Multi-scale Analysis And Theory Of Homogenization 2019

A Better Approach to Spectral Analysis | Hear from MATLAB & Simulink Developers

Learn the reasons behind why using a channelizer-based filter bank for spectral analysis is superior to other methods. This video walks through what a channelizer-based filter bank is, and it explains the benefits of using it over other techniques, such as the window and FFT method (also k

From playlist Tips and Tricks from MATLAB and Simulink Developers

Discretization and modelling of the non-cutoff Boltzmann collision operator using Hermite spectral

Zhenning Cai National University of Singapore, Singapore

From playlist 2018 Modeling and Simulation of Interface Dynamics in Fluids/Solids and Their Applications

In-medium Properties of Heavy Quarks on the Lattice by Hiroshi Ohno

DISCUSSION MEETING EXTREME NONEQUILIBRIUM QCD (ONLINE) ORGANIZERS: Ayan Mukhopadhyay (IIT Madras) and Sayantan Sharma (IMSc Chennai) DATE & TIME: 05 October 2020 to 09 October 2020 VENUE: Online Understanding quantum gauge theories is one of the remarkable challenges of the millennium

From playlist Extreme Nonequilibrium QCD (Online)

Jean Bourgain - 1/2 The orbital circle method and applications...

Jean Bourgain - The orbital circle method and applications / Toral eigenfuctions and their nodal sets

From playlist École d'été 2014 - Théorie analytique des nombres

Soledad Villar: "Graph neural networks for combinatorial optimization problems"

Machine Learning for Physics and the Physics of Learning 2019 Workshop IV: Using Physical Insights for Machine Learning "Graph neural networks for combinatorial optimization problems" Soledad Villar - New York University Abstract: Graph neural networks are natural objects to express fu

From playlist Machine Learning for Physics and the Physics of Learning 2019

Three Clustering Algorithms You Should Know: k-means clustering, Spectral Clustering, and DBSCAN

This video explains three different unsupervised clustering algorithms: k-means clustering, spectral clustering, and DBSCAN (Density-Based Spatial Clustering of Applications with Noise). Clustering algorithms are essential unsupervised learning techniques that aim to find groups of similar

From playlist Unsupervised Clustering Methods - Dr. Data Science Series

Graph Convolutional Networks (GCN) | GNN Paper Explained

❤️ Become The AI Epiphany Patreon ❤️ ► https://www.patreon.com/theaiepiphany ▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬▬ In this video I do a deep dive into the graph convolutional networks paper! It's currently the most cited paper in the GNN literature at the time of making this video. You'll learn abou

From playlist Graph Neural Nets

3 Easy Steps to Understand and Implement Spectral Clustering in Python

This video explains three simple steps to understand the Spectral Clustering algorithm: 1) forming the adjacency matrix of the similarity graph, 2) eigenvalue decomposition of the normalized adjacency matrix or Laplacian matrix, and 3) applying the KMeans clustering algorithm to the rows o

From playlist Unsupervised Clustering Methods - Dr. Data Science Series

André Voros - Resurgent Theta-functions...

Resurgent Theta-functions: a conjectured gateway into dimension D superior at 1 quantum mechanics Resurgent analysis of the stationary Schrödinger equation (exact-WKB method) has remained exclusivelyconfined to 1D systems due to its underlying linear-ODE techniques.Here, b

From playlist Resurgence in Mathematics and Physics

Spectral method

Related pages