C-XSC 2.0

swMATH182MaRDI QIDQ12949FDOQ12949

Author name not available (Why is that?)

Described by source

• Numerical Software with Result Verification

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Dense linear system: A parallel self-verified solver
• Multivariate rational data fitting: General data structure, maximal accuracy and object orientation
• Interval arithmetic for input-output models with inexact data
• On Newman polynomials which divide no Littlewood polynomial
• Title not available (Why is that?)
• OPTIMIZATION AND THE MIRANDA APPROACH IN DETECTING HORSESHOE-TYPE CHAOS BY COMPUTER
• Computing enclosures for the inverse square root and the sign function of a matrix
• A Computer-Assisted Proof of $\Sigma_3$-Chaos in the Forced Damped Pendulum Equation
• Rigorous Numerics for Global Dynamics: A Study of the Swift--Hohenberg Equation
• A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure
• Multiple/arbitrary precision interval computations in C-XSC
• Solvers for the verified solution of parametric linear systems
• Remarks on geometric properties of SQG sharp fronts and \(\alpha\)-patches
• Guaranteed estimation of the parameters of nonlinear continuous-time models: Contributions of interval analysis
• Verified error bounds for solutions of Sylvester matrix equations
• The exact dot product as basic tool for long interval arithmetic
• An enclosure method for the solution of linear odes with polynomial coefficients
• Efficient task scheduling in the parallel result-verifying solution of nonlinear systems
• Motivations for an arbitrary precision interval arithmetic and the MPFI library
• Guaranteed analysis and optimisation of parametric systems with application to their stability degree
• Title not available (Why is that?)
• Multiple solutions for a semilinear boundary value problem: a computational multiplicity proof.
• Title not available (Why is that?)
• A uniqueness result for a semilinear elliptic problem: a computer-assisted proof
• Numerical Software with Result Verification
• Interval Newton iteration in multiple precision for the univariate case
• A computer-assisted existence and multiplicity proof for travelling waves in a nonlinearly supported beam
• Interval analysis: Theory and applications
• Parallel Processing and Applied Mathematics
• Rigorous numerics for localized patterns to the quintic Swift-Hohenberg equation
• Verified Computation of Square Roots of a Matrix
• New solutions of the Gelfand problem
• Numerical Software with Result Verification
• Computational existence proofs for spherical \(t\)-designs
• Multisection in interval branch-and-bound methods for global optimization. II: Numerical tests
• Multisection in interval branch-and-bound methods for global optimization. I: Theoretical results
• Computer-assisted proofs in PDE: a survey
• Fast interval matrix multiplication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer-assisted proofs for semilinear elliptic boundary value problems
• Computational error bounds for multiple or nearly multiple eigenvalues
• Empirical convergence speed of inclusion functions for facility location problems
• Improved interval methods for solving circle packing problems in the unit square
• Parallel methods for verified global optimization practice and theory
• A new inclusion function for optimization: kite -- the one-dimensional case
• Title not available (Why is that?)
• ACETAF
• A computer-assisted proof for photonic band gaps
• Inner and outer bounds for the solution set of parametric linear systems
• The transmission process: a combinatorial stochastic process for the evolution of transmission trees over networks
• A verified optimization technique to locate chaotic regions of Hénon systems
• How trivial are reliable box-plane intersections?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast and correctly rounded logarithms in double-precision
• Computer-assisted enclosure methods for elliptic differential equations
• Verified Spatial Subdivision of Implicit Objects Using Implicit Linear Interval Estimations
• Verification methods: rigorous results using floating-point arithmetic
• Extended interval Newton method based on the precise quotient set
• Very fast and exact accumulation of products
• Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique
• Improved validated bounds for Taylor coefficients and for Taylor remainder series
• PROFIL/BIAS - A fast interval library
• On Taylor Model Based Integration of ODEs
• A new parallel method for verified global optimization
• High performance verified computing using C-XSC
• High accuracy and interval arithmetic on multicore processors
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• Computing Enclosures for the Matrix Exponential
• A note on the convergence of parametrised non-resonant invariant manifolds
• New interval methods for constrained global optimization
• Enclosing solutions of an inverse Sturm-Liouville problem for an impedance
• Title not available (Why is that?)
• Interval Methods for Global Optimization Using the Boxing Method
• An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations
• Title not available (Why is that?)
• Optimal centers in branch-and-prune algorithms for univariate global optimization
• An improved mathematical method for the identification of fuel cell impedance parameters based on the interval arithmetic
• Solving Dense Interval Linear Systems with Verified Computing on Multicore Architectures
• The Impact of Data Distribution in Accuracy and Performance of Parallel Linear Algebra Subroutines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advanced Arithmetic for the Digital Computer
• Global Smooth Solutions for the Inviscid SQG Equation
• SmartMOBILE and its Applications to Guaranteed Modeling and Simulation of Mechanical Systems
• A certificate-based approach to formally verified approximations
• Title not available (Why is that?)
• Computable bounds for Taylor coefficients of analytic functions
• Title not available (Why is that?)
• Constructing large feasible suboptimal intervals for constrained nonlinear optimization
• Automatic forward error analysis for floating point algorithms
• Verifying the existence of a zero for all elements of a function set
• L^pSpectral Radius Estimates for the Lamé System on an Infinite Sector
• Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm

This page was built for software: C-XSC 2.0