WITHDRAWN: A Space-Time Collocation Method for Solving Burger's Equation via Convex Relaxation

The ability to solve partial differential equations accurately, robustly, and scalably is a core aspect of computational fluid dynamics and, by extension, computational aerospace shape optimization. In this paper, we investigate a novel approach to the solution of nonlinear PDEs in conservation form. In particular, we consider a spectral approach where the complete space--time solution is approximated as a polynomial-augmented network of radial basis functions. Our approach extends Kansa's method to nonlinear PDEs in conservation form by introducing a convex relaxation for the flux term. Although the approach is quite general, we demonstrate its efficacy in solving the one-dimensional viscous Burger's equation. In addition to being meshless, this approach allows future exploration of one-shot convex optimization approaches to aerodynamic shape optimization.

Authors

Institutions

Publication Details

Published
2025-07-16
DOI
https://doi.org/10.2514/6.2025-3871
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

WITHDRAWN: A Space-Time Collocation Method for Solving Burger's Equation via Convex Relaxation

Juan J. Alonso, Daniel Berkenstock
Matrix Theory and Algorithms
article

WITHDRAWN: A Space-Time Collocation Method for Solving Burger's Equation via Convex Relaxation

Juan J. Alonso, Daniel Berkenstock
article en

Abstract

The ability to solve partial differential equations accurately, robustly, and scalably is a core aspect of computational fluid dynamics and, by extension, computational aerospace shape optimization. In this paper, we investigate a novel approach to the solution of nonlinear PDEs in conservation form. In particular, we consider a spectral approach where the complete space--time solution is approximated as a polynomial-augmented network of radial basis functions. Our approach extends Kansa's method to nonlinear PDEs in conservation form by introducing a convex relaxation for the flux term. Although the approach is quite general, we demonstrate its efficacy in solving the one-dimensional viscous Burger's equation. In addition to being meshless, this approach allows future exploration of one-shot convex optimization approaches to aerodynamic shape optimization.

Stanford University (US)
Openalex Percentile: Top 81%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.