Nothing Special   »   [go: up one dir, main page]

Giesl et al. - Google Patents

Grid refinement in the construction of Lyapunov functions using radial basis functions

Giesl et al.

View PDF
Document ID
4527885558109957297
Author
Giesl P
Mohammed N

External Links

Snippet

Lyapunov functions are a main tool to determine the domain of attraction of equilibria in dynamical systems. Recently, several methods have been presented to construct a Lyapunov function for a given system. In this paper, we improve the construction method for …
Continue reading at sussex.figshare.com (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G06F17/5036—Computer-aided design using simulation for analog modelling, e.g. for circuits, spice programme, direct methods, relaxation methods
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
    • G06F7/724—Finite field arithmetic
    • G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F1/00—Details of data-processing equipment not covered by groups G06F3/00 - G06F13/00, e.g. cooling, packaging or power supply specially adapted for computer application
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models

Similar Documents

Publication Publication Date Title
Larson et al. Derivative-free optimization methods
Hidding DiffExp, a Mathematica package for computing Feynman integrals in terms of one-dimensional series expansions
Bethke Genetic algorithms as function optimizers
Drineas et al. Clustering large graphs via the singular value decomposition
Liu et al. Learning discrete distributions: user vs item-level privacy
Buffa et al. Isogeometric analysis in electromagnetics: B-splines approximation
US20100325072A1 (en) System and method for solving multiobjective optimization problems
Piatkowski et al. Integer undirected graphical models for resource-constrained systems
Fernández-Real The thin obstacle problem: a survey
Houston et al. A posteriori error analysis of hp-version discontinuous Galerkin finite-element methods for second-order quasi-linear elliptic PDEs
Arnold et al. The Hellan--Herrmann--Johnson method with curved elements
Zhang et al. Fourth-order interface tracking in two dimensions via an improved polygonal area mapping method
Mohammed et al. Grid refinement in the construction of Lyapunov functions using radial basis functions
Neilan et al. The Monge–Ampère equation
Hecht et al. Multivariate Newton interpolation
Song et al. A shrinkage approach to improve direct bootstrap resampling under input uncertainty
Grimmer On optimal universal first-order methods for minimizing heterogeneous sums
Cristinelli et al. Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
Wei et al. From Gauss to Kolmogorov: Localized measures of complexity for ellipses
Manns et al. On convergence of binary trust-region steepest descent
Xu et al. Spectral method for the fractional Laplacian in 2D and 3D
Giesl et al. Grid refinement in the construction of Lyapunov functions using radial basis functions
Brown Simplification of truth-invariant cylindrical algebraic decompositions
Eck et al. Computationally efficient likelihood inference in exponential families when the maximum likelihood estimator does not exist
Choudhuri Bayesian bootstrap credible sets for multidimensional mean functional