Cover Image

Classifying extrema using intervals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gutowski, Marek W.
Format:	Preprint
Published:	2006
Subjects:	Mathematical Software Computational Complexity Numerical Analysis F.2.2; G.1.0; G.1.2; J.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reliability Conditions in Quadrature Algorithms
by: Adam, Gh., et al.
Published: (2003)

An algorithm for two-dimensional mesh generation based on the pinwheel tiling
by: Ganguly, Pritam, et al.
Published: (2004)

Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems
by: van Emden, M. H., et al.
Published: (2004)

Computing sharp and scalable bounds on errors in approximate zeros of univariate polynomials
by: Ramakrishna, P. H. D., et al.
Published: (2003)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
by: Shalaby, Ahmed, et al.
Published: (2024)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

Robust Randomized Low-Rank Approximation with Row-Wise Outlier Detection
by: Tiruvan, Aidan
Published: (2025)

PySLSQP: A transparent Python package for the SLSQP optimization algorithm modernized with utilities for visualization and post-processing
by: Joshy, Anugrah Jo, et al.
Published: (2024)

PosSLP and Sum of Squares
by: Bläser, Markus, et al.
Published: (2024)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
by: Wittwer, David, et al.
Published: (2024)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
by: Salas, Jesus
Published: (2025)

modOpt: A modular development environment and library for optimization algorithms
by: Joshy, Anugrah Jo, et al.
Published: (2024)

The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
by: Anand, Emile, et al.
Published: (2024)

A study on radial basis function and quasi-Monte Carlo methods
by: Chen, W., et al.
Published: (2002)

The Banach-Butterfly Invariant: Influence-Adaptive Walsh Geometry for Ternary Polynomial Threshold Functions
by: Pavlov, Gorgi
Published: (2026)

An SMT Formalization of Mixed-Precision Matrix Multiplication: Modeling Three Generations of Tensor Cores
by: Valpey, Benjamin, et al.
Published: (2025)

Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra
by: Bhattacharjee, Rajarshi, et al.
Published: (2023)

Improved Spectral Density Estimation via Explicit and Implicit Deflation
by: Bhattacharjee, Rajarshi, et al.
Published: (2024)

Spectral Methods via FFTs in Emerging Machine Number Formats: OFP8, Bfloat16, Posit, and Takum Arithmetics
by: Hunhold, Laslo, et al.
Published: (2025)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

On the Complexity of Problems on Graphs Defined on Groups
by: Das, Bireswar, et al.
Published: (2025)

Faster Inversion and Other Black Box Matrix Computations Using Efficient Block Projections
by: Eberly, Wayne, et al.
Published: (2007)

Certification of the QR factor R, and of lattice basis reducedness
by: Villard, Gilles
Published: (2007)

Formal Verification of COO to CSR Sparse Matrix Conversion (Invited Paper)
by: Appel, Andrew W.
Published: (2025)

Two-Sided Lossless Expanders in the Unbalanced Setting
by: Chattopadhyay, Eshan, et al.
Published: (2024)

Recurrence relations and fast algorithms
by: Tygert, Mark
Published: (2006)

Discrete Fourier Transform Approximations Based on the Cooley-Tukey Radix-2 Algorithm
by: Coelho, D. F. G., et al.
Published: (2024)

A Robust Solution Procedure for Hyperelastic Solids with Large Boundary Deformation
by: Shontz, Suzanne M., et al.
Published: (2006)

Deciding One to One property of Boolean maps: Condition and algorithm in terms of implicants
by: Sule, Virendra
Published: (2023)

Complexity of Firefighting on Graphs
by: Althoetmar, Julius, et al.
Published: (2025)

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity
by: Knop, Dušan, et al.
Published: (2017)

Thin Tree Verification is coNP-Complete
by: Moayyedi, Alice
Published: (2025)

New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)

Some recent advances on the RBF
by: Chen, W
Published: (2002)

A Case Study on Numerical Analysis of a Path Computation Algorithm
by: Boussu, Grégoire, et al.
Published: (2024)

On the hull and interval numbers of oriented graphs
by: Araujo, J., et al.
Published: (2022)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
by: Fairbairn, David L., et al.
Published: (2024)

A sufficient condition for global invertibility of Lipschitz mapping
by: Tarasov, S.
Published: (2002)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
by: Könen, David, et al.
Published: (2023)