2022
DOI: 10.1016/j.camwa.2022.06.009
|View full text |Cite
|
Sign up to set email alerts
|

Singular boundary method for 2D and 3D acoustic design sensitivity analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 31 publications
(7 citation statements)
references
References 41 publications
0
1
0
Order By: Relevance
“…Dynamic programming algorithm is an effective method suitable for solving overlapping subproblems and optimal substructure problems created by the American mathematician Bellman in the study of optimization problems of multi-stage decision-making process [5] , which is commonly used for solving complex problems in mathematics, finance and computer science, and whose basic idea is to decompose the problem to be solved into a number of simple and interconnected subproblems, solving the subproblems first, and then using the solution of the subproblems as a The basic idea is to decompose the problem to be solved into several simple and interrelated sub-problems, solve the sub-problems first, and then use the solution of the sub-problems as the condition of the upper problem until the solution of the original problem is found. It is worth noting that the problems solved by dynamic programming are often not independent of each other after the decomposition of the subproblems [6].…”
Section: Dynamic Planning Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Dynamic programming algorithm is an effective method suitable for solving overlapping subproblems and optimal substructure problems created by the American mathematician Bellman in the study of optimization problems of multi-stage decision-making process [5] , which is commonly used for solving complex problems in mathematics, finance and computer science, and whose basic idea is to decompose the problem to be solved into a number of simple and interconnected subproblems, solving the subproblems first, and then using the solution of the subproblems as a The basic idea is to decompose the problem to be solved into several simple and interrelated sub-problems, solve the sub-problems first, and then use the solution of the sub-problems as the condition of the upper problem until the solution of the original problem is found. It is worth noting that the problems solved by dynamic programming are often not independent of each other after the decomposition of the subproblems [6].…”
Section: Dynamic Planning Algorithmmentioning
confidence: 99%
“…(4) Then iterates through all the gold mines accordingly, and finally F [5][10], which is the result needed for this question Algorithmic Analysis:…”
Section: Dynamic Planning Algorithmmentioning
confidence: 99%
“…Models for surface scattering and in particular scattering due to diffraction represent a major research field within acoustics [9][10][11][12]. Several models for the scattering of acoustic energy have recently been presented for use in many different models [13][14][15][16][17]. In particular, methods to include scattering from diffraction have been introduced in multiple tools for geometric modelling [1,18,19].…”
Section: Introductionmentioning
confidence: 99%
“…In addition to the classical FE approximation approach, boundary element and boundary-based techniques are also effective numerical approaches for acoustic propagation analysis [36][37][38][39][40]. Compared to the FE approach, only the boundary discretization is needed in these boundary-based methods, and the considered problem in d-dimensions can be reduced to a d − 1 dimensional problem [41][42][43][44][45][46][47][48][49], hence the scale of the constructed system matrix equation is clearly smaller than that in the FE approach. However, these obtained system matrices are always dense and non-sparse; hence, the storage and treatment of these system matrices are not as easy as in the FE approach.…”
Section: Introductionmentioning
confidence: 99%