Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1709.03298

Dimension reduction in heterogeneous parametric spaces with application to naval engineering shape design problems

Marco Tezzele·Filippo Salmoiraghi·Andrea Mola·Gianluigi Rozza
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present the results of the first application in the naval architecture field of a methodology based on active subspaces properties for parameters space reduction. The physical problem considered is the one of the simulation of the hydrodynamic flow past the hull of a ship advancing in calm water. Such problem is extremely relevant at the preliminary stages of the ship design, when several flow simulations are typically carried out by the engineers to assess the dependence of the hull total resistance on the geometrical parameters of the hull, and others related with flows and hull properties. Given the high number of geometric and physical parameters which might affect the total ship drag, the main idea of this work is to employ the active subspaces properties to identify possible lower dimensional structures in the parameter space. Thus, a fully automated procedure has been implemented to produce several small shape perturbations of an original hull CAD geometry, in order to exploit the resulting shapes to run high fidelity flow simulations with different structural and physical parameters as well, and then collect data for the active subspaces analysis. The free form deformation procedure used to morph the hull shapes, the high fidelity solver based on potential flow theory with fully nonlinear free surface treatment, and the active subspaces analysis tool employed in this work have all been developed and integrated within SISSA math- Lab as open source tools. The contribution will also discuss several details of the implementation of such tools, as well as the results of their application to the selected target engineering problem.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Tezzele, Filippo Salmoiraghi, Andrea Mola, Gianluigi Rozza. 2018-10-11. Dimension reduction in heterogeneous parametric spaces with application to naval engineering shape design problems. https://doi.org/10.1186/s40323-018-0118-3

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗