1. The document proposes an effective methodology called the variation iteration method to find solutions to a general class of singular second-order linear and nonlinear boundary value problems.
2. The variation iteration method generates a sequence of correction functionals that converges to the exact solution of the boundary value problem.
3. The author applies the variation iteration method to solve a specific class of boundary value problems and derives the sequence of correction functionals. Convergence of the iterative sequence is also analyzed.
Derivation and Application of Multistep Methods to a Class of First-order Ord...AI Publications
Of concern in this work is the derivation and implementation of the multistep methods through Taylor’s expansion and numerical integration. For the Taylor’s expansion method, the series is truncated after some terms to give the needed approximations which allows for the necessary substitutions for the derivatives to be evaluated on the differential equations. For the numerical integration technique, an interpolating polynomial that is determined by some data points replaces the differential equation function and it is integrated over a specified interval. The methods show that they are only convergent if and only if they are consistent and stable. In our numerical examples, the methods are applied on non-stiff initial value problems of first-order ordinary differential equations, where it is established that the multistep methods show superiority over the single-step methods in terms of robustness, efficiency, stability and accuracy, the only setback being that the multi-step methods require more computational effort than the single-step methods.
Derivation and Application of Multistep Methods to a Class of First-order Ord...AI Publications
Of concern in this work is the derivation and implementation of the multistep methods through Taylor’s expansion and numerical integration. For the Taylor’s expansion method, the series is truncated after some terms to give the needed approximations which allows for the necessary substitutions for the derivatives to be evaluated on the differential equations. For the numerical integration technique, an interpolating polynomial that is determined by some data points replaces the differential equation function and it is integrated over a specified interval. The methods show that they are only convergent if and only if they are consistent and stable. In our numerical examples, the methods are applied on non-stiff initial value problems of first-order ordinary differential equations, where it is established that the multistep methods show superiority over the single-step methods in terms of robustness, efficiency, stability and accuracy, the only setback being that the multi-step methods require more computational effort than the single-step methods.
Comparative Study of the Effect of Different Collocation Points on Legendre-C...IOSR Journals
We seek to explore the effects of three basic types of Collocation points namely points at zeros of Legendre polynomials, equally-spaced points with boundary points inclusive and equally-spaced points with boundary point non-inclusive. Established in literature is the fact that type of collocation point influences to a large extent the results produced via collocation method (using orthogonal polynomials as basis function). We
analyse the effect of these points on the accuracy of collocation method of solving second order BVP. For equally-spaced points we further consider the effect of including the boundary points as collocation points. Numerical results are presented to depict the effect of these points and the nature of problem that is best handled by each.
The paper reports on an iteration algorithm to compute asymptotic solutions at any order for a wide class of nonlinear
singularly perturbed difference equations.
Computer Science
Active and Programmable Networks
Active safety systems
Ad Hoc & Sensor Network
Ad hoc networks for pervasive communications
Adaptive, autonomic and context-aware computing
Advance Computing technology and their application
Advanced Computing Architectures and New Programming Models
Advanced control and measurement
Aeronautical Engineering,
Agent-based middleware
Alert applications
Automotive, marine and aero-space control and all other control applications
Autonomic and self-managing middleware
Autonomous vehicle
Biochemistry
Bioinformatics
BioTechnology(Chemistry, Mathematics, Statistics, Geology)
Broadband and intelligent networks
Broadband wireless technologies
CAD/CAM/CAT/CIM
Call admission and flow/congestion control
Capacity planning and dimensioning
Changing Access to Patient Information
Channel capacity modelling and analysis
Civil Engineering,
Cloud Computing and Applications
Collaborative applications
Communication application
Communication architectures for pervasive computing
Communication systems
Computational intelligence
Computer and microprocessor-based control
Computer Architecture and Embedded Systems
Computer Business
Computer Sciences and Applications
Computer Vision
Computer-based information systems in health care
Computing Ethics
Computing Practices & Applications
Congestion and/or Flow Control
Content Distribution
Context-awareness and middleware
Creativity in Internet management and retailing
Cross-layer design and Physical layer based issue
Cryptography
Data Base Management
Data fusion
Data Mining
Data retrieval
Data Storage Management
Decision analysis methods
Decision making
Digital Economy and Digital Divide
Digital signal processing theory
Distributed Sensor Networks
Drives automation
Drug Design,
Drug Development
DSP implementation
E-Business
E-Commerce
E-Government
Electronic transceiver device for Retail Marketing Industries
Electronics Engineering,
Embeded Computer System
Emerging advances in business and its applications
Emerging signal processing areas
Enabling technologies for pervasive systems
Energy-efficient and green pervasive computing
Environmental Engineering,
Estimation and identification techniques
Evaluation techniques for middleware solutions
Event-based, publish/subscribe, and message-oriented middleware
Evolutionary computing and intelligent systems
Expert approaches
Facilities planning and management
Flexible manufacturing systems
Formal methods and tools for designing
Fuzzy algorithms
Fuzzy logics
GPS and location-based app
In this paper, the L1 norm of continuous functions and corresponding continuous estimation of regression parameters are defined. The continuous L1 norm estimation problem of one and two parameters linear models in the continuous case is solved. We proceed to use the functional form and parameters of the probability distribution function of income to exactly determine the L1 norm approximation of the corresponding Lorenz curve of the statistical population under consideration.
We use stochastic methods to present mathematically correct representation of the wave function. Informal construction was developed by R. Feynman. This approach were introduced first by H. Doss Sur une Resolution Stochastique de l'Equation de Schrödinger à Coefficients Analytiques. Communications in Mathematical Physics
October 1980, Volume 73, Issue 3, pp 247–264.
Primary intention is to discuss formal stochastic representation of the Schrodinger equation solution with its applications to the theory of demolition quantum measurements.
I will appreciate your comments.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
PHP Frameworks: I want to break free (IPC Berlin 2024)Ralf Eggert
In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development.
This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Welocme to ViralQR, your best QR code generator.ViralQR
Welcome to ViralQR, your best QR code generator available on the market!
At ViralQR, we design static and dynamic QR codes. Our mission is to make business operations easier and customer engagement more powerful through the use of QR technology. Be it a small-scale business or a huge enterprise, our easy-to-use platform provides multiple choices that can be tailored according to your company's branding and marketing strategies.
Our Vision
We are here to make the process of creating QR codes easy and smooth, thus enhancing customer interaction and making business more fluid. We very strongly believe in the ability of QR codes to change the world for businesses in their interaction with customers and are set on making that technology accessible and usable far and wide.
Our Achievements
Ever since its inception, we have successfully served many clients by offering QR codes in their marketing, service delivery, and collection of feedback across various industries. Our platform has been recognized for its ease of use and amazing features, which helped a business to make QR codes.
Our Services
At ViralQR, here is a comprehensive suite of services that caters to your very needs:
Static QR Codes: Create free static QR codes. These QR codes are able to store significant information such as URLs, vCards, plain text, emails and SMS, Wi-Fi credentials, and Bitcoin addresses.
Dynamic QR codes: These also have all the advanced features but are subscription-based. They can directly link to PDF files, images, micro-landing pages, social accounts, review forms, business pages, and applications. In addition, they can be branded with CTAs, frames, patterns, colors, and logos to enhance your branding.
Pricing and Packages
Additionally, there is a 14-day free offer to ViralQR, which is an exceptional opportunity for new users to take a feel of this platform. One can easily subscribe from there and experience the full dynamic of using QR codes. The subscription plans are not only meant for business; they are priced very flexibly so that literally every business could afford to benefit from our service.
Why choose us?
ViralQR will provide services for marketing, advertising, catering, retail, and the like. The QR codes can be posted on fliers, packaging, merchandise, and banners, as well as to substitute for cash and cards in a restaurant or coffee shop. With QR codes integrated into your business, improve customer engagement and streamline operations.
Comprehensive Analytics
Subscribers of ViralQR receive detailed analytics and tracking tools in light of having a view of the core values of QR code performance. Our analytics dashboard shows aggregate views and unique views, as well as detailed information about each impression, including time, device, browser, and estimated location by city and country.
So, thank you for choosing ViralQR; we have an offer of nothing but the best in terms of QR code services to meet business diversity!
Solution of a singular class of boundary value problems by variation iteration method
1. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
Solution of a Singular Class of Boundary Value Problems by
Variation Iteration Method
Bhupesh K. Tripathi
Department of Mathematics, C.M.P. College, University of Allahabad, Allahabad-211002, India
Email: bupeshkt@gmail.com
Abstract
In this paper, an effective methodology for finding solution to a general class of singular second order
linear as well as nonlinear boundary value problems is proposed. These types of problems commonly occur
in physical problems. The solution is developed by constructing a sequence of correctional functional via
variation Iteration theory. The analytical convergence of such occurring sequences befitting to the context
of the class of such existing problems is also discussed. The efficacy of the proposed method is tested on
various problems. It is also observed that execution of only few successive iterations of correction
functionals may lead to a solution that is either exact solution or very close to the exact solution.
Keywords: Variation iteration method, sequence, linearization, discretization, transformation Convergence,
Lagrange multiplier, smooth function, B-Spline, projection method, Lie group
1. Introduction
A wide spectrum of well defined properties and behavior systematically associated to a class of
events/situations occurring on varied fronts in celestial bodies or multidisciplinary sciences either internally
or externally or both ways simultaneously are realized or discerned in real or abstract sense. When these
problems are modeled mathematically in order to envisage or acknowledge the endowed and all inherent
characteristics in and around thereof, a class of second order singular differential equations along with two
boundary conditions comes into coherent consideration. Therefore, for such class a suitable and sustainable
solution either numerically appropriate or analytically in the exact form, is must and equally important in
whatsoever manner it is made possible by applying so any feasible proposed variant.
Consider a general class of boundary value problems as follows
x −α (x α y / )/ = f (x, y) 0< ������ ≤ 1 (1.1)
y(0) =A , y(1) =B
A, B are constants andα ∈ ℝ − set of real numbers. The function f(x, y) is a real valued continuous
∂f
function of two variables x and y such that (x, y) ∈ ℝ × ℝ and that is a nonnegative and continuous
∂y
function in a domain R = {(x, y) :(x, y)∈[0 1]× ℝ}. Solution to such class of problems exists [7-8]. Out of
such class it plausible to consider a sub-class formed when α ∈(0 1)⊆ ℝ for elaborated analysis and
discussion of facts. The class of problems (1.1) from a specific area of the field of differential equation has
been a matter of immense research and keen interest to researchers in recent past. Several methods like
B-Spline, homotopy method, Lie group analysis, power series method, projection method, Adomian
method, multi- integral method, finite difference method [9- 15] have been applied on to justify an
immaculate importance of such class of problems. Variation iteration method, a modified Lagrange method
[16] originally proposed by He [17-21], stands recognized as promising and profusely used method of
research in almost all disciplines of science and technology as an alternative method which is different from
other methods of linearization, transformation and discretization used to solve such type of problems in
some way or other way round. It is pertinent to note that the proposed method has fared well, over a large
class of mathematically modeled problems whenever or wheresoever’s such a suitable situation has have
aroused and it is demanded to be applied so. Eventually, credit accrue to variation iteration method for
solving a class of distinguished and challenging problems like, nonlinear coagulation problem with mass
1
2. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
loss ,nonlinear fluid flow in pipe-like domain, nonlinear heat transfer, an approximate solution for one
dimensional weakly nonlinear oscillations, nonlinear relaxation phenomenon in polycrystalline solids,
nonlinear thermo elasticity, cubic nonlinear Schrodinger equation, semi-linear inverse parabolic equation,
ion acoustic plasma wave, nonlinear oscillators with discontinuities ,non-Newtonian flows, Burger’s and
coupled Burger’s equation, multispecies Lotaka –Volterra equations, rational solution of Toda lattice
equation, Helmholtz equation, generalized KdV equation[17-34].
2. Variation Iteration Method (VIM)
The basic virtue and fundamental principle associated to variation iteration method may be expressed in
brief by considering a general differential equation involving a differential operator D as follows.
Let Dy(x) = g(x) x∈Ι⊆ℝ (2.1)
y(x) is sufficiently smooth function on some domain Ω and g(x) an inhomogeneous real valued function.
(2.1) can be rewritten as,
L (y(x)) + N (y(x)) = g(x) x∈Ι⊆ℝ (2.2)
where L and N are linear and nonlinear differential operators, respectively.
Ostensibly, the privileged variation iteration method has natural aptness and basic tendency to generate a
recursive sequence of correction functionals that commands and allows to conserve a real power and
absolute potential for finding a just and acceptable solution to the given class of problems (1.1) and the
sequence of correctional functional over(2.2) is
x
̃
yn+1 (x) = yn (x) + ∫ μ(s) ((L (yn (s)) +N (yn (s)) – g (s)) ds , n≥0 (2.3)
0
where μ stands for Lagrange multiplier determined optimally satisfying all stationary conditions after the
variation method is applied to (2.3). The importance and therefore utility of method all over lies with the
assumption and choice of considering the concerned inconvenient highly nonlinear and complicated
dependent variables as restricted variables thereby minimizing its magnitude, the accruing error that might
have crept into the error prone process while finding a solution to (1.1). As aforementioned, yn is the
̃
restricted variation, which means δyn
̃=0. Eventually, after desired μ is determined, a proper and suitable
selective function (linear or nonlinear) with respect to (2.2) is assumed as an initial approximation for
finding next successive iterative function by recursive sequence of correction functional. Thereafter
boundary conditions are imposed on the final or preferably on limiting value (as n → ∞) of sequential
approximations incurred after due process of iteration.
3. Variational Method and Lagrange Multiplier
The variational method and Lagrange multiplier are convoluted corresponding to (1.1) by the iterative and
successive correction functional relation as
x /
yn+1 (x) ̃
= yn (x) + ∫ μ(s) (s α yn (s))/ -x α f(s, yn (s))) ds n≥0 (3.1)
0
where yn (x) is nth approximated iterative solution of (1.1). Suppose optimal value of μ(s) is identified
naturally by taking variation with respect to yn (x) and subject to restricted variation δyn =0. Then from
̃(x)
(3.1) we have
x / ̃
δyn+1 (x) =δyn (x) +δ ∫ μ(s)((s α yn )/ -s α f(s, yn (s)) ds n≥0 (3.2)
0
Integrating by parts and considering the restricted variation of yn (i.e. δyn =0) as well relation (3.2) gives
/ x
δyn (x) = (1- μ/ (s)) δyn (x) + δ(μ(s) s α yn (s)) |s=x + ∫ (μ/ (s) s α )/ δyn (s)ds,
0
n ≥ 0
Therefore, the stationary conditions are
μ/ (s) s α = 0, μ(x) = 0 , (μ/ (s)s α )/ = 0
It gives
S1−α −X1−α
µ(s)=
1−α
From (3.1), the sequence of correction functionals is given by
1 x
yn+1 (x) =yn (x) + ∫ (s α -x α ) ((s α yn (s))/ -s α̃yn (s))ds
f(s, n≥ 0 (3.4)
1−α 0
2
3. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
∞
It may be deduced from (3.4) that the limit of the convergent iterative sequence {yn } , if it converges
n=1
on satisfying given boundary conditions, is the exact solution to (1.1).
4. Convergence of Iterative Sequence
In order to carry out convergence analysis of the sequence of correctional functionals generated by
execution of VIM with respect to given class (1.1) in view of (3.1), we consider
yn+1(x) = yn (x) +∑n−1(yk+1 (x) − yk (x)) is the nth partial sum of the infinite series
k=0
y0 (x) +∑∞ (yk+1 (x)−yk (x))
k=0 (4.1)
And that convergence of auxiliary series (4.1) necessarily implies the convergence of iterative sequence
{yn (x)}∞ of partial
n=1 sums of the series (4.1).
Let y0 (x) be the assumed initial selective function. The first successive variation iterate is given by
x /
y1 (x)=∫ μ (s)((s α y0 (s))/ _s α f(s, y0 (s)))ds
0
(4.2)
Integrating by parts and in sequel applying the existing stationary conditions, we have
x /
|y1 (x)− y0 (x)|=|∫ (y0 (s)+μ(s)s α f(s, y0 (s))ds|
0
(4.3)
x
Or |y1 (x)-y0 (x)|≤ 0
| y0 (s)|+|s α ||µ
∫( 1
(s)||f(s,y0 (s)|)ds
x 1
Or | y1 (x)-y0 (x) | ≤ ∫ ( | y0 (s) | + |µ || f(s,y0 (s)|)
0
(s) ds (4.4)
Again pursuing similar steps as in (4.2) and adopting usual stationary conditions likewise, relation (3.4)
gives
x
|y2 (x) − y1 (x)|=|∫ μ(s) s α(f(s),y1 (s))−f(s,y0 (s))ds|
0
(4.5)
x
Or, |y2 (x) − y1 (x)|≤ ∫ |μ(s)||s α |(f(s),y1 (s))−f(s,y0 (s))|ds
0
x
Or, |y2 (x) − y1 (x)|≤ ∫ |μ(s)| (f(s), y1 (s))− f(s, y0 (s))
0
|ds (4.6)
In general, we have
x
|yn+1 (x)−yn (x)|=|∫ μ(s)s α (f(s,yn (s))−f(s,yn−1 (s)))ds|
0
(4.7)
x
Or, |yn+1(x) – yn (x)|≤ ∫ |μ(s) ||s α || (f(s,yn (s)) −f(s,yn−1 (s)))
0
|ds ∀ n ≥ 2
x
Or, |yn+1 (x) −yn (x)|≤ ∫ |μ(s) || (f(s,yn (s)) −f(s,yn−1 (s))) |ds
0
∀ n ≥2 (4.8)
∂f(x,y)
Since f(x, y) and are continuous on R, therefore for fix sϵ [0 1] and by virtue of
∂y
mean value theorem ∃ (s,θ0 (s))∈ R satisfying (say, yn−1 (s) < θ0 (s) < yn (s)),
n n
∀n ∈ IN , s≤ x ≤ 1 , such that
∂f(s,θ0 (s))
n+1
|f(s, yn (s)) −f(s, yn−1 (s))| = | ||yn (s) −yn−1 (s)| ∀ n ≥ 2 (4.9)
∂y
Now, suppose
1 /
M∞ =sup (|y0 (s) |+|μ(s)|| f(s, y0 (s))| , s ≤ x ≤ 1 (4.10)
∞ ∂f(s,θ0 (s))
n
and M2 =sup (|μ(s)|| |) , s ≤ x ≤ 1 , n∈ IN (4.11)
∂y
Again to begin with assume
1 2
M=sup(M∞ ,M∞ ) (4.12)
We observe and proceed to establish the truthfulness of the inequality
Mn+1 xn+1
|yn+1 (s) −yn (s)| ≤ ∀n ∈ IN (4.13)
n+1!
Relations (4.4), (4.10), (4.9) and (4.12) give
x x
| y1 (x)-y0 (x) | ≤ ∫ M1 ds
o
≤ ∫ M ds ds
0
= Mx (4.14)
∂f(s,θ0 (s)) x
As well as, |y2 (x) − y1 (x)|≤ sup|μ(s)|| 1
|∫ |(y1 (
0
s)) − y0 (s) )|ds
∂f(s,θ0 (s)) ∂y x
1 x M2 x2
or |y2 (x) − y1 (x)|≤ sup(|μ(s)|| | ∫ |(y1 (
0
s)) − y0 (s))|ds=M∫ M ds=
0
∂y 2
s ≤ x ≤ 1 ,n∈ IN
3
4. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
Thus, the statement (4.13) is true for natural number n=1
Mn xn
Suppose that |yn (s) −yn−1 (s)| ≤ holds for some, n ∈ IN
n!
Then, relations (4.8), (4.9) and (4.12) imply
x ∂f(s,θ0 (s))
n
|yn+1 (x)−yn (x)|≤ ∫ |μ(s)||
0
||yn (s)−yn−1 (s)|ds
∂y
x ∂f(s,θ0 (s))
n
i.e. |yn+1 (x) - yn (x ) | ≤ ∫ |sup(μ(s))| (sup| ∂y
0
|)|yn (s) −yn−1 (s) |ds
s≤x≤1 n ∈ IN
∂f(s,θ0 (s))
n+1 x
or , |yn+1(x) −yn (x)| ≤ sup(|μ(s)| | | ∫0 |yn (s) − yn−1 (s)|ds
∂y
x Mn sn Mn+1 xn+1
≤ M∫0
ds=
n! n+1!
Therefore, by Principle of Induction
Mn+1 xn+1
|yn+1 (x) − yn (x) |≤ holds ∀xϵ [0 1] and ∀n ∈ IN.
n+1!
So the series (4.1) converges both absolutely and uniformly for all x ∈ [0 1]
Mn+1 xn+1
Since, |y0 (x)|+∑∞ |yn+1 (x) −yn (x)|≤ |y0 (x)|+∑∞
n=0 n=0 =| y0 (x)|+ (eMx −1), ∀x ∈[01]
n+1!
Asserting that the series y0 (x) +∑∞ (yk+1 (x)−yk (x)) converges uniformly ∀x ∈ [01] and hence the
k=0
sequence of its partial sums {yn (x)}∞ converges to a limit function as the solution.
n=0
5. Numerical Problem
To begin with implementation and analyze scope of VIM, we apply this very method to find the solution of
linear and nonlinear problems that have been solved by different methods in literature. Specifically to
mention is the method to solve it numerically and via numerical finite difference technique of solution.
Example 1: Consider the following boundary value problem [12]
α
y (2) (x)+ y (1) (x) = −x1−α cos x −(2−α)x1−α sin x (5.1)
x
y(0) = 0 , y(1) = cos 1
Solution: To solve this we construct correction functional as follows
x /
yn+1 (x) = yn (x) + ∫ μ(s) ((−s α yn (s))/ − s cos s – (2−α) sin s) ds ,
0
n≥0
where μ(s) Is optimally identified Lagrange multiplier similar to (3.3). The first iterative solution is
given by
x /
y1 (x) = yo (x) + ∫ μ(s) ((−s α y0 (s))/ − s cos s – (2−α) sin s) ds
0
Since the selective function y0 (x) is arbitrary for simplicity and easiness we may choose
/
y0 (x) = a 0 x1−α , so that (−s α y0 )/ ) = 0
x
Thus, y1 (x) = a 0 x1−α + ∫ μ(s)
0
(−s cos s – (2−α) sin s) ds
Now performing usual simplifications and applying term by term series integration, we get
x2n+3 x2n+1−α
y1 (x) = a 0 x1−α −[ ∑∞(−1)n
0 (2n+3−α)(2n+1)!
+ (1−α) ∑∞ (−1)n+1
n=1 (2n+1−α)(2n)!
]
1−α x2n
1−α
or y1 (x) = a 0 x + x ∑∞ (−1)n
n=1 (2n)!
2n
x
or y1 (x) = a 0 x1−α +x1−α ∑∞ (−1)n
n=0 − x1−α
(2n)!
i.e. y1 (x) == (a 0 − 1) x1−α + x1−α cos x (5.2)
In order to match the boundary condition y(1) = cos(1) taking limit as (x → 1) we find a0 = 1 ,
only the first iterate giving the exact solution as y(x)= y1 (x) = x1−α cos x
Example-2: Consider the boundary value problem [12]
(x α y / )/ = βx α+β−2 ((α + β − 1) + βx β ) y
4
5. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
y (0) =1 , y(1) =exp (1) (5.3)
Solution: The correction functional for the problem (5.3) is
x /
yn+1 (x) =yn (x) + ∫ μ(s) ((s α yn )/ − β (α + β − 1)s α+β−2 − β2 s α+β−2 ) yn (s)
0
(5.4)
μ(s) Is optimally identified Lagrange multiplier similar as (3.2)
Inserting, y (0)=y0 (x)=1 to (5.4) when n=1, as selective initial approximation function we process out
following induced successive iterative approximate solutions as
x2β
y1 (x) = 1+x β +β
2(α+β−1)
x2β x3β
y2 (x) = 1+x β + +β
2.1 3(α+3β−1)
x2β x3β x4β
y3 (x) = 1+x β + + +β
2.1 3.2.1 4.2(α+4β−1)
x2β x3β x4β x5β
y4 (x) = 1+x β + + + +β
2.1 3.2.1 4.3.2.1 5.3.2(α+5β−1)
x2β x3β x4β x5β x6β
y5 (x) = 1+x β + + + + +β
2.1 3.2.1 4.3.2.1 5.4.3.2.1 6.4.3.2(α+6β−1)
Similarly, continuing in like manner inductively we find the general term of the sequence
x2β x3β x4β x5β x6β xnβ nβx(n+1)β
yn (x) = 1+x β + + + + + +………… + +
2.1 3.2.1 4.3.2.1 5.4.3.2.1 6.5.4.3.2.1 n! n+1!(α+(n+1)β−1)
xkβ nβx(n+1)β
i.e. yn (x) = ∑n
k=0 + (5.5)
k! n+1!(α+(n+1)β−1)
nβx(n+1)β
Now, we observe that Tn = (say), is the general term of a convergent
n+1!(α+(n+1)β−1)
nβx(n+1)β
Series ∑∞
n=0 .
n+1!(α+(n+1)β−1)
nβx(n+1)β
Therefore, lim (n→ ∞) = 0 and (5.5) facilitates the exact solution to (5.3) as
x kβ n+1!(α+(n+1)β−1)
y(x) =lim (n→ ∞)( ∑n
k=0 k! ) =exp (x β
).
Example-3: Consider the boundary value problem [9]
βxα
(x α y / )/ = (βx β ey − (α + β − 1))
4+xβ
1 1
y (0) =ln , y(1) = ln (5.6)
4 5
1
Solution: Let, y0 = y(0) = ln , be the selective initial approximation function .Then by VIM
4
First iterative approximate solution to (5.6) simplifies to
1 x μ(s) β2 sα+2β−2
y1 (x) = ln + ∫0 ( − (α+β − 1) βα s α+β−2 ) ds (5.7)
4 4+xβ 4
where as μ(s) is optimally identified Lagrange multiplier as existing in (3.3) and after simplifying (5.4)
1
the required first approximate solution to (5.6) satisfying the given boundary condition y(0) = ln is
4
as follows
1 xβ 1 xβ α+2β−1 (−1)n xβ
y1 (x) =ln − + ( )2 +∑∞ (
n=3 )( ) ( )n (5.8)
4 4 2 4 α+nβ−1 n 4
Now, we observe in (5.8) that the first three terms of the first approximate iterative solution of (5.6) match
the first three terms of the expanded Taylor’s series solution even though only first boundary condition is
5
6. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
being used so for. However, if we allow β to tend to zero in (5.8) βas β is arbitrary, y1 (x) violates the
1 α+2β−1 (−1)n x
condition y(0) = ln . But if the terms ( ) and ( ) ( )n are treated independent to each
4 α+nβ−1 n 4 α+2β−1
othern andβ arbitrarily parameter β is allowed to approach to zero only in the coefficient ( ) of
(−1) x n 1 α+nβ−1
( ) ( ) independently, the boundary condition y(1) = ln expressed in expanded series form
n 4 5
matches the prescribed value if it is imposed on y1 (x). Thus improvisation on y1 (x)in this way not only
shoots to satisfy the other boundary condition but also exculpate to procures the exact solution. Therefore,
allowing the process to do so and let the first iterate mend its way to produce exact solution y(x) = y1 (x)
to the problem (5.3). Therefore the exact solution to (5.6) is given by
1 xβ 1 xβ (−1)n xβ 1
y(x) = y1 (x) = ln − + ( )2 )n +∑∞ (
n=3 )( )n =ln
4 4 2 4 n 4 4+xβ
6. Conclusion
In this paper, we have applied the He’s variation iteration method successfully to a linear as well as to a
nonlinear class of boundary value problems. The convergence analysis of the proposed method with
reference to considered class has also been presented in exhaustive manner. A proper selection of selective
function and careful imposition of boundary condition on iterative function may lead to an exact solution
or any other solution of high accuracy even to a non-linear problem in just only some maneuvered
simplifications.
References
S.Chandrasekher; Introduction to the study of stellar structure: Dover, New York 1967.
A.S.Eddington; The Internal constitution of the stars: Cambridge University Press, London.
N.Tosaka, S.Miyake; Numerical Approximation by an integral equation for the unsteady state heat
conduction in the human head; J. College of industrial Technology: Nihon University 15(1982)69.
D.S.Mc Elwain; A reexamination of oxygen diffusion in a spherical cell with Michaela-Menton Kinetics
J.Theo.Bio. 71(1978)255.
N. Andersion, A.M.Arthers; Complementary variational principles for diffusion problems with Michaelis-
Menton Kinetics: Bull. Math Bio. 42(1980)131.
Adam J.A. and Maggelakis S.A, Mathematical models of tumor growth IV Effects of a Necrotic core;
Math.Bio. (1989) 121136.
Pandey R.K., Verma A.K, Existence-Uniqueness results for a class of singular boundary value problems
arising in physiology, Nonlinear Analysis: Real World Application, 9(2008)40-52.
W.F.Ford, J.A.Pennline; Singular nonlinear two-point boundary value problems; Existence and uniqueness:
Nonlinear Analysis: 1(2009)1059-1072.
M, M, Chawala; A fourth order finite difference method based on uniform mess for singular boundary value
problems: Journal of Computational and applied mathematics 17 (1987)359-364.
G.N.Reddien; Projection Method and singular two point boundary value problems: Numerische
Mathematik 121.193-205. D01.10.1007/BFD 1436623.
S.R.K.Iyenger, Pragya Jain; Spline finite difference methods for singular two- point boundary value
Problems; Numerishe Mathematik50 (1987) 363-376.
Manoj Kumar; Higher order method for singular boundary value problems by using spline function:
Journal of: Appl.Maths and Comput: 192(2007)17.
A.S.V.Ravi Kanth, Y.N.Reddy; Cubic spline for a class of two-point boundary value problems. Appl. Maths
and Comput.170 (2005)733-740.
Vedat Suat Erturk; Differential Transformation method for solving differential equation of Lane-Emden
type. Math. Comput. Appl. 12(2007)135-139.
D.D.Ganji, A.Sadighi; Application of homotopy perturbation and variational iteration methods to nonlinear
heat transfer and porous meadia equations: J.of Comput and Appl. Math: 207(1): (2007)24-34.
6
7. Mathematical Theory and Modeling www.iiste.org
ISSN 2224-5804 (Paper) ISSN 2225-0522 (Online)
Vol.1, No.4, 2011
Inokuti M, Sekine H, MuraT; General use of Lagrange multiplier in mathematical physics In: Nemat-
Nasseds Editor: variational method in mechanics of solids: Pergamon Press: (1978)156-162.
He J.H.; Variational iteration method –a kind of non linear analytical technique: some examples; J. Non
linear Mech. 34(1999)699-708.
He J.H. Variational iteration method-some recent results and new interpretations: J.Comput. Appl Math.
207(2007): 3-17.
J.H.He, X.H.Wu; Variational iteration method, new development and application: J.Comput. Math. Appl
54(2007): 881-894.
A.S.V.Ravi Kanth, K.Aruna; He’s variational iteration method for treating nonlinear Singular boundary
Value problems; J.Computers and Maths. with appl. (2010).
S. M.Goh, M. S.Noorani, I.Hashim; introducing variational iteration method to a bio-chemical reaction
Model: Nonlinear Analysis; RealWorld Application 11(2010)2264-2272.
E.M.Abulwafa, M.A.Abdou, A.A.Mahmoud; The solution of nonlinear coagulation problems with mass
loss: Chaos, Solitons and Fractals29 (2)(2006)313-330.
G.E.Draganescu, V.Capalnasan; Nonlinear relaxation phenomenon in polycrystalline solids: International
Journal of nonlinear Science and Numerical Simulations 4(3) (2003) 219-225.
V.Marinka; An approximate solution for one dimensional weakly nonlinear oscillators: International
Journal of nonlinear sciences and Numerical Simulations:3(2)(2002)107 120.
N.H.Swailam; Variational iteration method for solving cubic nonlinear Schrodinger Equation: J. of Comput
and Appl.Maths 07 (1) (2007)155-163.
N.H.Swailam, M.M.Khader; Variational iteration method for one dimensional nonlinear thermo elasticity;
Chaos Solitons and Fractals: 32(1)(2007)145-149.
M.Tatari, M.Dehghan; He’s variational method for computing a control parameter in semi linear inverse
parabolic equation: Chaos Solitons and Fractals, 33(2) (2007)671-677.
H.M.Lu; Approximate period of nonlinear oscillators with discontinuities by modifiedLindstedt-Poincare
Method: Chaos, Solitons and Fractals, 23(2)(2005)577-579.
A.M.Siddiqui, M.Ahmed, Q.K.Ghori; Couette and Poiseuille flows for non-Newtonianfluids; International
Journal of Nonlinear Science and Numerical Simulations, 7(1)(2006) 15-26.
M.A.Abdou, A.A.Soliman; Variational iterational method for solving Burger’s and coupled Burger’s
equations: J. of Comput. And Appl. Mathematics, 181(2005)245-251.
B.Batiha, M.S.M.Noorani, I.Hashim; Variational iteration method for solving multi species Lotaka –
Volterra equations: J. of Comput. And Appl. Mathematics: 54(2007)903-909.
W.X.Ma, Y.You; Rational solution of the Toda lattice equation in casoratian form: Chaos, Solitons and
Fractals: 22(2004)395-406.
S.Momani, Z.Odibat; Application of He’s variational method to Helmholtz equations: Chaos, Solitons
and Fractals: 27(5) (2006)1119-1123.
S.T. MohyudDin, M.A. Noor, K.I. Noor; Travelling wave solution of seventh order generalized KdV
equations using He’s polynomials Journal Of Nonlinear Sciences and Numerical Simulations10
(2)(2009)223-229.
Bhupesh K. tripathi is working in the Department of Mathematics, C.M.P. College, Allahabad University,
Allahabad, India. He did his MSc in Mathematics from Indian Institute of Technology, Kanpur, India. His
area of research singular boundary value problemss
7