Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

A domain decomposition framework for fluid-structure interaction problems

Alfio Quarteroni, Simone Deparis, Marco Discacciati
2006
Conference Papers

Abstract

In this note we review some classical algorithms for fluid-structure interaction problems and we propose an alternative viewpoint mutuated from the domain decomposition theory. This approach yields preconditioned Richardson iterations on the Steklov-Poincaré nonlinear equation at the fluid-structure interface.

Official source

Alfio Quarteroni, Simone Deparis, Marco Discacciati
2006
Conference Papers

Abstract

Official source

Related concepts (12)

Computational fluid dynamics

Computational fluid dynamics (CFD) is a branch of fluid mechanics that uses numerical analysis and data structures to analyze and solve problems that involve fluid flows. Computers are used to perform the calculations required to simulate the free-stream flow of the fluid, and the interaction of the fluid (liquids and gases) with surfaces defined by boundary conditions. With high-speed supercomputers, better solutions can be achieved, and are often required to solve the largest and most complex problems.

Quantum algorithm

In quantum computing, a quantum algorithm is an algorithm which runs on a realistic model of quantum computation, the most commonly used model being the quantum circuit model of computation. A classical (or non-quantum) algorithm is a finite sequence of instructions, or a step-by-step procedure for solving a problem, where each step or instruction can be performed on a classical computer. Similarly, a quantum algorithm is a step-by-step procedure, where each of the steps can be performed on a quantum computer.

Shor's algorithm

Shor's algorithm is a quantum algorithm for finding the prime factors of an integer. It was developed in 1994 by the American mathematician Peter Shor. It is one of the few known quantum algorithms with compelling potential applications and strong evidence of superpolynomial speedup compared to best known classical (that is, non-quantum) algorithms. On the other hand, factoring numbers of practical significance requires far more qubits than available in the near future.

Related publications (30)

A domain decomposition framework for fluid-structure interaction problems

Graph Chatbot

Quantum radio astronomy: Data encodings and quantum image processing

The complexity of quantum support vector machines

A Reduced Order Model for Domain Decompositions with Non-conforming Interfaces