Concept

Computation

Publications associées (204)

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Siam Publications2024

COMMUNICATION LOWER BOUNDS AND OPTIMAL ALGORITHMS FOR MULTIPLE TENSOR-TIMES-MATRIX COMPUTATION

Laura Grigori

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. We establish communication lower bounds that determine ...

Philadelphia2024

Butterfly effects in perceptual development: A review of the 'adaptive initial degradation' hypothesis

Lukas Vogelsang, Marin Vogelsang

Human perceptual development evolves in a stereotyped fashion, with initially limited perceptual capabilities maturing over the months or years following the commencement of sensory experience into robust proficiencies. This review focuses on the functiona ...

San Diego2024

Parametric Reduced Order Model of a Gas Bearings Supported Rotor

Fabio Nobile, Jürg Alexander Schiffmann, Dimitri Maurice Goutaudier

Gas bearings use pressurized gas as a lubricant to support and guide rotating machinery. These bearings have a number of advantages over traditional lubricated bearings, including higher efficiency in a variety of applications and reduced maintenance requi ...

2024

Analytical Model of Single-Sided Linear Induction Motors for High-Speed Applications

André Hodder, Lucien André Félicien Pierrejean, Simone Rametti

This article describes a field-based analytical model of single-sided linear induction motors (SLIMs) that explicitly considers the following effects altogether: finite motor length, magnetomotive force mmf space harmonics, slot effect, edge effect, and ta ...

2024

Computational models of intrinsic motivation for curiosity and creativity

Wulfram Gerstner, Alireza Modirshanechi, Sophia Becker

We link Ivancovsky et al.'s novelty-seeking model (NSM) to computational models of intrinsically motivated behavior and learning. We argue that dissociating different forms of curiosity, creativity, and memory based on the involvement of distinct intrinsic ...

2024

Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems\ast

Daniel Kressner

By the addition of entropic regularization, multimarginal optimal transport problems can be trans-formed into tensor scaling problems, which can be solved numerically using the multimarginal Sinkhorn algorithm. The main computational bottleneck of this alg ...

SIAM PUBLICATIONS2023

Accelerated deep self-supervised ptycho-laminography for three-dimensional nanoscale imaging of integrated circuits

Yi Jiang, Manuel Guizar Sicairos

Three-dimensional inspection of nanostructures such as integrated circuits is important for security and reliability assurance. Two scanning operations are required: ptychographic to recover the complex transmissivity of the specimen, and rotation of the s ...

2023

A mixed precision LOBPCG algorithm

Daniel Kressner, Meiyue Shao, Yuxin Ma

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work, we propose a mix ...

SPRINGER2023

Automated planning for the construction of laterally resistant masonry walls using irregular stones

Katrin Beyer, Bryan German Pantoja Rosero, Qianqing Wang, Ketson Roberto Maximiano Dos Santos

The construction industry's carbon footprint may be reduced by switching to the usage of natural stones as building materials. Construction of dry-joint stone masonry structures is difficult because of the irregular shapes and the nonuniform sizes of the s ...

2023

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search