Efficient algorithm for computing QFT bounds
From MaRDI portal
Publication:3577873
DOI10.1080/00207170903390161zbMATH Open1209.93061OpenAlexW1997130518MaRDI QIDQ3577873FDOQ3577873
Authors: Shih-Feng Yang 
Publication date: 26 July 2010
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207170903390161
Recommendations
- Quantum algorithm for Feynman loop integrals
- Efficient algorithms for approximating quantum partition functions
- AN ALGORITHMIC APPROACH TO QUANTUM FIELD THEORY
- Efficient algorithm for perturbative calculation of multi-loop Feynman integrals
- Efficient approximation algorithm for the Schrödinger–Possion system
- Efficient computation of Wigner-Eisenbud functions
- Algorithms for minimal Picard-Fuchs operators of Feynman integrals
- Improvements on the computation of boundaries in QFT
- Analytic computing methods for precision calculations in quantum field theory
- Efficient Algorithms for Computing Sommerfeld Integral Tails
Cites Work
- Multi‐input/single‐output computer‐aided control design using the quantitative feedback theory
- Simple pivoting algorithm for root-locus method of linear systems with delay
- Invited paper Survey of quantitative feedback theory (QFT)
- Improvements on the computation of boundaries in QFT
- Single-Loop QFT Design for Robust Performance in the Presence of Non-Parametric Uncertainties
- Computation of QFT bounds for robust tracking specifications
- Direct control design in sampled-data uncertain systems
- Template generation for continuous transfer functions using interval analysis
- An Efficient Algorithm for Computing QFT Bounds
- Recursive grid methods to compute value sets and Horowitz–Sidi bounds
- QFT Templates for Plants With a High Number of Uncertainty Parameters
- Generation of frequency-response templates for linear systems with an uncertain time delay and multilinearly-correlated parameter perturbations
- QFT template generation for time-delay plants based on zero-inclusion test
Cited In (10)
- Computation of QFT bounds for robust tracking specifications
- A QFT procedure for generating design frequencies and bounds of guaranteed accuracy
- Improvements on the computation of boundaries in QFT
- Generation of QFT bounds for robust tracking specifications for plants with affinely dependent uncertainties
- Robust and Nonlinear Control: literature survey (No. 18)
- Algorithmic foundations for the diffraction limit
- Analytical formulation to compute QFT bounds: The envelope method
- Recursive grid methods to compute value sets and Horowitz–Sidi bounds
- Efficient computation of Wigner-Eisenbud functions
- Quantum algorithm for Feynman loop integrals
This page was built for publication: Efficient algorithm for computing QFT bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3577873)
