Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems

Abstract Common formulations of the eddy current problem involve either vector or scalar potentials, each with its own advantages and disadvantages. An impasse arises when using scalar potential-based formulations in the presence of conductors with non-trivial topology. A remedy is to augment the approximation spaces with generators of the first cohomology group. Most existing algorithms for this require a special, e.g., hierarchical, finite element basis construction. Using insights from de Rham complex approximation with splines, we show that additional conditions are here unnecessary. Spanning tree techniques can be adapted to operate on a hexahedral mesh resulting from isomorphisms between spline spaces of differential forms and de Rham complexes on an auxiliary control mesh.

Authors

Institutions

Publication Details

Journal
Advances in Computational Mathematics
Published
2024-08-19
DOI
https://doi.org/10.1007/s10444-024-10181-0
Citations
1
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.37

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems

Sebastian Schöps, Melina Merkel, Rafael Vázquez, Bernard Kapidani
1 citations
Advances in Computational Mathematics
Advanced Numerical Analysis Techniques
0.37
article

Arbitrary order spline representation of cohomology generators for isogeometric analysis of eddy current problems

Sebastian Schöps, Melina Merkel, Rafael Vázquez, Bernard Kapidani
article en
1 citations

Abstract

Abstract Common formulations of the eddy current problem involve either vector or scalar potentials, each with its own advantages and disadvantages. An impasse arises when using scalar potential-based formulations in the presence of conductors with non-trivial topology. A remedy is to augment the approximation spaces with generators of the first cohomology group. Most existing algorithms for this require a special, e.g., hierarchical, finite element basis construction. Using insights from de Rham complex approximation with splines, we show that additional conditions are here unnecessary. Spanning tree techniques can be adapted to operate on a hexahedral mesh resulting from isomorphisms between spline spaces of differential forms and de Rham complexes on an auxiliary control mesh.

Advances in Computational MathematicsVol. 50(5)
Universidade de Santiago de Compostela (ES), Centro de Supercomputación de Galicia (ES), Technische Universität Darmstadt (DE), École Polytechnique Fédérale de Lausanne (CH)
National Science Foundation, TU Graz, Internationale Beziehungen und Mobilitätsprogramme, Deutsche Forschungsgemeinschaft, Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, Austrian Science Fund, Technische Universität Darmstadt
Openalex Percentile: Top 44%
Advanced Numerical Analysis Techniques
0.37
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.