English
Related papers

Related papers: An FFT-based method for computing the effective cr…

200 papers

In this paper, we develop a theory of new classes of discrete convex functions, called L-extendable functions and alternating L-convex functions, defined on the product of trees. We establish basic properties for optimization: a…

Optimization and Control · Mathematics 2016-01-19 Hiroshi Hirai

In this paper, we present a general framework for efficiently computing diverse solutions to combinatorial optimization problems. Given a problem instance, the goal is to find $k$ solutions that maximize a specified diversity measure; the…

Data Structures and Algorithms · Computer Science 2025-04-25 Yuni Iwamasa , Tomoki Matsuda , Shunya Morihira , Hanna Sumita

In [Bonito et al., J. Comput. Phys. (2022)], a local discontinuous Galerkin method was proposed for approximating the large bending of prestrained plates, and in [Bonito et al., IMA J. Numer. Anal. (2023)] the numerical properties of this…

Numerical Analysis · Mathematics 2024-10-30 Andrea Bonito , Diane Guignard , Angelique Morvant

Simulations of fluid flow in naturally fractured rocks have implications for several subsurface applications, including energy storage and extraction, and waste storage. We are interested in flow in discrete fracture networks, which…

Numerical Analysis · Mathematics 2018-11-14 Alessio Fumagalli , Eirik Keilegavlen , Stefano Scialò

We give the first almost-linear total time algorithm for deciding if a flow of cost at most $F$ still exists in a directed graph, with edge costs and capacities, undergoing decremental updates, i.e., edge deletions, capacity decreases, and…

Data Structures and Algorithms · Computer Science 2024-07-16 Jan van den Brand , Li Chen , Rasmus Kyng , Yang P. Liu , Simon Meierhans , Maximilian Probst Gutenberg , Sushant Sachdeva

We introduce a robust optimization method for flip-free distortion energies used, for example, in parametrization, deformation, and volume correspondence. This method can minimize a variety of distortion energies, such as the symmetric…

Graphics · Computer Science 2022-11-17 Oded Stein , Jiajin Li , Justin Solomon

Several challenging problem in clustering, partitioning and imaging have traditionally been solved using the "spectral technique". These problems include the normalized cut problem, the graph expander ratio problem, the Cheeger constant…

Optimization and Control · Mathematics 2016-10-14 Dorit S. Hochbaum

Cut finite element method (CutFEM) based approaches towards challenging fluid-structure interaction (FSI) are proposed. The different considered methods combine the advantages of competing novel Eulerian (fixed-grid) and established…

Computational Engineering, Finance, and Science · Computer Science 2018-07-31 Benedikt Schott , Christoph Ager , Wolfgang A. Wall

In order to prevent velocity, pressure, and temperature spikes at material discontinuities occurring when the interface-capturing schemes inconsistently simulate compressible multi-material flows(when the specific heats ratio is…

Computational Physics · Physics 2020-12-29 Zhiwei He , Yousheng Zhang , Li Li , Baolin Tian

We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…

Statistical Mechanics · Physics 2025-12-15 Davide Gabrielli , Rosemary J. Harris

A local discontinuous Galerkin (LDG) method for approximating large deformations of prestrained plates is introduced and tested on several insightful numerical examples in our previous computational work. This paper presents a numerical…

Numerical Analysis · Mathematics 2021-12-20 Andrea Bonito , Diane Guignard , Ricardo Nochetto , Shuo Yang

We give a deterministic algorithm for finding the minimum (weight) cut of an undirected graph on $n$ vertices and $m$ edges using $\text{polylog}(n)$ calls to any maximum flow subroutine. Using the current best deterministic maximum flow…

Data Structures and Algorithms · Computer Science 2022-05-31 Jason Li , Debmalya Panigrahi

By using the Onsager principle as an approximation tool, we give a novel derivation for the moving finite element method for gradient flow equations. We show that the discretized problem has the same energy dissipation structure as the…

Numerical Analysis · Mathematics 2020-09-04 Xianmin Xu

To enable fast uncertainty quantification of fluid flow in a discrete fracture network (DFN), we present two approaches to quickly compute fluid flow in DFNs using combinatorial optimization algorithms. Specifically, the presented Hanan…

Geophysics · Physics 2018-11-14 A. Hobé , D. Vogler , M. P. Seybold , A. Ebigbo , R. R. Settgast , M. O. Saar

Fast-Fourier Transform (FFT) methods have been widely used in solid mechanics to address complex homogenization problems. However, current FFT-based methods face challenges that limit their applicability to intricate material models or…

Materials Science · Physics 2024-10-15 Mohit Pundir , David S. Kammer

An estimate of the effective toughness of heterogeneous materials is proposed based on the Phase Field Fracture model implemented in an FFT homogenization solver. The estimate is based on the simulation of the deformation of representative…

Materials Science · Physics 2025-08-12 Pedro Aranda , Javier Segurado

A variational coarse-graining framework for heterogeneous media is developed that allows for a seamless transition from the traditional static scenario to a arbitrary loading conditions, including inertia effects and body forces. The…

Materials Science · Physics 2015-10-09 Chenchen Liu , Celia Reina

In fractured natural formations, the equations governing fluid flow and geomechanics are strongly coupled. Hydrodynamical properties depend on the mechanical configuration, and they are therefore difficult to accurately resolve using…

Numerical Analysis · Mathematics 2021-04-07 Matteo Cusini , Joshua A. White , Nicola Castelletto , Randolph R. Settgast

This paper bridges discrete and continuous optimization approaches for decomposable submodular function minimization, in both the standard and parametric settings. We provide improved running times for this problem by reducing it to a…

Data Structures and Algorithms · Computer Science 2021-03-08 Kyriakos Axiotis , Adam Karczmarz , Anish Mukherjee , Piotr Sankowski , Adrian Vladu

The balanced hypergraph partitioning problem is to partition a hypergraph into $k$ disjoint blocks of bounded size such that the sum of the number of blocks connected by each hyperedge is minimized. We present an improvement to the…

Data Structures and Algorithms · Computer Science 2020-03-30 Lars Gottesbüren , Michael Hamann , Sebastian Schlag , Dorothea Wagner