The following pages link to Herbert Fischer (Q586499):
Displaying 48 items.
- (Q686057) (redirect page) (← links)
- A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices (Q686058) (← links)
- Interval Newton method: Hansen-Greenberg approach - some procedural improvements (Q751765) (← links)
- Geometric conditions for generic structure of multivariable root-loci (Q799622) (← links)
- Desynchronization of linear systems (Q801866) (← links)
- Necessary and sufficient conditions for interval polynomials to have only real distinct roots (Q804230) (← links)
- Multicriterion optimization using interval analysis (Q913459) (← links)
- Automatic differentiation: Parallel computation of function, gradient, and Hessian matrix (Q914328) (← links)
- Interval iteration for zeros of systems of equations (Q1064017) (← links)
- Efficient algorithm for matrix spectral factorization (Q1071712) (← links)
- (Q1116640) (redirect page) (← links)
- Fast method to compute the scalar product of gradient and given vector (Q1116641) (← links)
- Automatic differentiation of the vector that solves a parametric linear system (Q1176796) (← links)
- Efficient algorithms for the inclusion of the inverse matrix using error- bounds for hyperpower methods (Q1179546) (← links)
- Über das Divergenzverhalten des Intervall-Newton-Verfahrens. (On the divergence behaviour of the interval-Newton-method) (Q1179547) (← links)
- On the solution of interval linear systems (Q1184703) (← links)
- Automatic differentiation in MATLAB (Q1184723) (← links)
- Circular centered forms for rational functions in several complex variables (Q1195397) (← links)
- On global optimization using interval arithmetic (Q1195964) (← links)
- Automatic differentiation of characterizing sequences (Q1263225) (← links)
- A minimal code list (Q1287095) (← links)
- The if-problem in automatic differentiation (Q1334756) (← links)
- Nonconvex polygon interval arithmetic as a tool for the analysis and design of robust control systems (Q1582460) (← links)
- Application of Bernstein expansion to the solution of control problems (Q1582464) (← links)
- Iterative methods for simultaneous inclusion of polynomial zeros (Q1801245) (← links)
- Automatic differentiation: Reduced gradient and reduced Hessian matrix (Q1803653) (← links)
- Reducing the wrapping effect (Q1893152) (← links)
- Enclosing solutions of overdetermined systems of linear interval equations (Q1916992) (← links)
- Robust and efficient ray intersection of implicit surfaces (Q1971092) (← links)
- Interval constraint plotting for interactive visual exploration of implicitly defined relations (Q1971100) (← links)
- (Q2702005) (← links)
- (Q3201636) (← links)
- ON THE RADSTRÖM EMBEDDING THEOREM (Q3697593) (← links)
- (Q3719253) (← links)
- (Q3810792) (← links)
- (Q4022670) (← links)
- (Q4028381) (← links)
- (Q4039385) (← links)
- (Q4066494) (← links)
- (Q4149572) (← links)
- (Q4207512) (← links)
- (Q4215369) (← links)
- (Q5608818) (← links)
- (Q5655490) (← links)
- On factorization of analytic functions and its verification (Q5926520) (← links)
- Diagrammatic representation for interval arithmetic (Q5929745) (← links)
- Acceleration of iteration methods for interval fixed point problems (Q5929751) (← links)
- A priori estimates for the zeros of interval polynomials (Q5948583) (← links)
