On the Notes of Quasi-Boundary Value Method for Solving Cauchy-Dirichlet Problem of the Helmholtz Equation
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 22, Issue 2
Abstract
The Cauchy-Dirichlet problem of the Helmholtz equation yields unstable solution, which when solved with the Quasi-Boundary Value Method (Q-BVM) for a regularization parameter = 0. At this point of regularization parameter, the solution of the Helmholtz equation with both Cauchy and Dirichlet boundary conditions is unstable when solved with the Q-BVM. Thus, the quasi-boundary value method is insufficient and inefficient for regularizing ill-posed Helmholtz equation with both Cauchy and Dirichlet boundary conditions. In this paper, we introduce an expression 1 (1+ 2) ; ∈ R, where is the regularization parameter, which is multiplied by w(x; 1) and then added to the Cauchy and Dirichlet boundary conditions of the Helmholtz equation. This regularization parameter overcomes the shortcomings in the Q-BVM to account for the stability at = 0 and extend it to the rest of values of R.
Authors and Affiliations
Benedict Barnes, F. O. Boateng, S. K. Amponsah, E. Osei-Frimpong
Keywords
Related Articles
- EP ID EP322719
- DOI 10.9734/BJMCS/2017/32727
- Views 93
- Downloads 0
A Comparative Analysis of Jellyfish Attacks and Black Hole Attack with Selfish Behavior Attack under AODV Routing Protocol
The applications of mobile adhoc network (MANET) are increasing day-by-day due to the flexibility they provide to seamless communication. However MANETS are vulnerable to number of attacks because of properties like non-...
Computation of k-out-of-n System Reliability via Reduced Ordered Binary Decision Diagrams
A prominent reliability model is that of the partially-redundant (k-out-of-n) system. We use algebraic as well as signal-flow-graph methods to explore and expose the AR algorithm for computing k-out-of-n reliability. We...
Empirical Performance of Internal Sorting Algorithm
Internal Sorting Algorithms are used when the list of records is small enough to be maintained entirely in primary memory for the duration of the sort, while External Sorting Algorithms are used when the list of records...
Solving Multi-level Multi-objective Fractional Programming Problem with Rough Intervals in the Objective Functions
In this paper multi-level multi-objective fractional programming problem (ML-MOFP) is considered where some or all of its coefficients in the objective function are rough intervals. At the first phase of the solution app...
1P-ABC, a Simpli ed ABC Variant for Continuous Optimization Problems
In this paper a novel simpli ed and fast variant of the ABC algorithm is proposed, 1 Population ABC (1P-ABC), with the aim to increase the eciency of the ABC algorithm by using only one population of bees, the employed...