Born approximation in linear-time invariant system

被引:0
|
作者
Gumjudpai, Burin [1 ]
机构
[1] Naresuan Univ, Inst Fundamental Study, Tah Poe Acad Inst, Phitsanulok 65000, Thailand
来源
关键词
D O I
10.1088/1742-6596/901/1/012173
中图分类号
O59 [应用物理学];
学科分类号
摘要
An alternative way of finding the LTI's solution with the Born approximation, is investigated. We use Born approximation in the LTI and in the transformed LTI in form of Helmholtz equation. General solution are considered as infinite series or Feynman graph. Slow-roll approximation are explored. Transforming the LTI system into Helmholtz equation, approximated general solution can be found for any given forms of force with its initial value.
引用
收藏
页数:4
相关论文
共 50 条
  • [31] FINDING A KEKULE STRUCTURE IN A BENZENOID SYSTEM IN LINEAR-TIME
    HANSEN, P
    JAUMARD, B
    SACHS, H
    ZHENG, ML
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1995, 35 (03): : 561 - 567
  • [32] A nearly linear-time approximation scheme for the euclidean k-median problem
    Kolliopoulos, Stavros G.
    Rao, Satish
    SIAM JOURNAL ON COMPUTING, 2007, 37 (03) : 757 - 782
  • [33] A nearly linear-time approximation scheme for the Euclidean k-median problem
    Kolliopoulos, SG
    Rao, S
    ALGORITHMS - ESA'99, 1999, 1643 : 378 - 389
  • [34] A linear-time approximation algorithm for the minimum-length geometric embedding of trees
    Bagheri, Alireza
    Keshavarz-Kohjerdi, Fatemeh
    Razzazi, Mohammadreza
    OPTIMIZATION, 2024,
  • [35] Linear-time approximation algorithms for computing numerical summation with provably small errors
    Kao, MY
    Wang, J
    SIAM JOURNAL ON COMPUTING, 2000, 29 (05) : 1568 - 1576
  • [36] A Linear-time Graph Kernel
    Hido, Shohei
    Kashima, Hisashi
    2009 9TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, 2009, : 179 - 188
  • [37] Linear-time transitive orientation
    McConnell, RM
    Spinrad, JP
    PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1997, : 19 - 25
  • [38] Linear-Time Limited Automata
    Guillon, Bruno
    Prigioniero, Luca
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2018, 2018, 10952 : 126 - 138
  • [40] PROJECTIVE PLANARITY IN LINEAR-TIME
    MOHAR, B
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1993, 15 (03): : 482 - 502