نتایج جستجو برای: Bound-ary Value Problems

تعداد نتایج: 1420797  

Journal: :caspian journal of mathematical sciences 0
a. yazdani department of mathematics, university of mazandaran s gharbavi department of mathematics, university of mazandara

in this paper, we solve a linear system of second-order boundary value problems by using the quadratic b-spline nite el- ement method (fem). the performance of the method is tested on one model problem. comparisons are made with both the analyti- cal solution and some recent results.the obtained numerical results show that the method is ecient.

A. Yazdani, S Gharbavi

In this paper, we solve a linear system of second-order boundary value problems by using the quadratic B-spline nite el- ement method (FEM). The performance of the method is tested on one model problem. Comparisons are made with both the analyti- cal solution and some recent results.The obtained numerical results show that the method is ecient.

2011
STEPHEN COOK PIERRE MCKENZIE DUSTIN WEHR MARK BRAVERMAN RAHUL SANTHANAM

We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarithmic space lower bound. The input to the problem is a rooted, balanced d-ary tree of height h, whose internal nodes are labeled with d-ary functions on [k] = {1, . . . , k}, and whose leaves are labeled with elements of...

2000
JOHN M. DAVIS John M. Davis Johnny Henderson

We prove the existence of a solution for the nonlinear boundary value problem u = f ( x, u, u′′, . . . , u ) , x ∈ [0, 1], u(0) = 0 = u(1), 0 ≤ i ≤ m + 1, where f : [0, 1] × R → R is continuous. The technique used here is a monotone method in the presence of upper and lower solutions. We introduce a new maximum principle which generalizes one due to Bai which in turn was an improvement of a max...

1996
Fabrizio Petrini Marco Vanneschi

Many theoretical models of parallel computation are based on overly simplistic assumptions on the performance of the interconnection network. For example they assume constant latency for any communication pattern or innnite bandwidth. This paper presents a case study based on the FFT transpose algorithm, which is mapped on two families of scalable interconnection networks, the k-ary n-trees and...

1998

10] Z. Shen, Boundary value problems for parabolic Lam e systems and a nonstation-ary linearized system of Navier-Stokes equations in Lipschitz cylinders, Amer. J.

پایان نامه :دانشگاه تربیت معلم - تهران - دانشکده ادبیات و زبانهای خارجی 1390

the frame semantic theory is a nascent approach in the area of translation studies which goes beyond the linguistic barriers and helps us to incorporate cognitive and cultural factors to the study of translation. based on rojos analytical model (2002b), which centered in the frames or knowledge structures activated in the text, the present research explores the various translation problems that...

2010
Shengfeng Zhu Qingbiao Wu Chunxiao Liu

The aim of this paper is to propose a variational piecewise constant level set method for solving elliptic shape and topology optimization problems. The original model is approximated by a two-phase optimal shape design problem by the ersatz material approach. Under the piecewise constant level set framework, we first reformulate the two-phase design problem to be a new constrained optimization...

Journal: :Mathematics 2023

Percolation theory is a subject that has been flourishing in recent decades. Because of its simple expression and rich connotation, it widely used chemistry, ecology, physics, materials science, infectious diseases, complex networks. Consider an infinite-rooted N-ary tree where each vertex assigned i.i.d. random variable. When the variable follows Bernoulli distribution, path called head run if...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید