Concept

Root-finding algorithms

Related publications (32)

Geometry-Driven Stock-Constrained Truss Design via Equilibrium-Based Structural Models

This paper presents a geometry-driven approach to form-finding with reused stock elements. Our proposed workflow uses a K-mean algorithm to cluster stock elements and incorporate their geometrical values early in the form-finding process. A feedback loop i ...

Springer2024

Safe Zeroth-Order Convex Optimization Using Quadratic Local Approximations

Giancarlo Ferrari Trecate, Maryam Kamgarpour, Yuning Jiang, Baiwei Guo

We address black-box convex optimization problems, where the objective and constraint functions are not explicitly known but can be sampled within the feasible set. The challenge is thus to generate a sequence of feasible points converging towards an optim ...

2023

Estimation of Self-Exciting Point Processes from Time-Censored Data

Thomas Alois Weber, Philipp Schneider

Self-exciting point processes, widely used to model arrival phenomena in nature and society, are often difficult to identify. The estimation becomes even more challenging when arrivals are recorded only as bin counts on a finite partition of the observatio ...

2023

Manning's Formula and the Strickler Scaling Derived from a Co-spectral Budget Model

Gabriele Manoli, Sara Bonetti, Gabriel George Katul

Manning's empirical formula in conjunction with Strickler's scaling is widely used to predict the bulk velocity (V) from the hydraulic radius (Rh), the roughness size (r), and the slope of the energy grade line (S) in uniform channel flows at high bulk Rey ...

2023

Identifying invariant solutions of wall-bounded three-dimensional shear flows using robust adjoint-based variational techniques

Tobias Schneider, Omid Ashtari

Invariant solutions of the Navier-Stokes equations play an important role in the spatiotemporally chaotic dynamics of turbulent shear flows. Despite the significance of these solutions, their identification remains a computational challenge, rendering many ...

Cambridge2023

Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization

Volkan Cevher, Alp Yurtsever, Maria-Luiza Vladarean

We propose a stochastic conditional gradient method (CGM) for minimizing convex finitesum objectives formed as a sum of smooth and non-smooth terms. Existing CGM variants for this template either suffer from slow convergence rates, or require carefully inc ...

2022

An Inverse-Filter-Based Method to Locate Partial Discharge Sources in Power Transformers

Marcos Rubinstein, Hamidreza Karami

Partial discharge (PD) occurrence in power transformers can lead to irreparable damage to the power network. In this paper, the inverse filter (IF) method to localize PDs in power transformers is proposed. To the best of the authors’ knowledge, this is the ...

2022

Light Path Gradients for Forward and Inverse Rendering

Tizian Lucien Zeltner

Physically based rendering is a process for photorealistic digital image synthesis and one of the core problems in computer graphics. It involves simulating the light transport, i.e. the emission, propagation, and scattering of light through a virtual scen ...

EPFL2021

Generalization of Quasi-Newton Methods: Application to Robust Symmetric Multisecant Updates

Nicolas Boumal

Quasi-Newton (qN) techniques approximate the Newton step by estimating the Hessian using the so-called secant equations. Some of these methods compute the Hessian using several secant equations but produce non-symmetric updates. Other quasi-Newton schemes, ...

MICROTOME PUBLISHING2021

Substructured Two-grid and Multi-grid Domain Decomposition Methods

Tommaso Vanzan

Two-level domain decomposition methods are very powerful techniques for the efficient numerical solution of partial differential equations (PDEs). A two-level domain decomposition method requires two main components: a one-level preconditioner (or its corr ...

2021

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.