نتایج جستجو برای: laplacian systems

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

2012
Inchang Choi Minhaeng Lee Yu-Wing Tai

We present an algorithm for extracting high quality temporally coherent alpha mattes of objects from a video. Our approach extends the conventional image matting approach, i.e. closed-form matting, to video by using multi-frame nonlocal matting Laplacian. Our multi-frame nonlocal matting Laplacian is defined over a nonlocal neighborhood in spatial temporal domain, and it solves the alpha mattes...

2010
Said El Manouni Kanishka Perera

We obtain multiple non-trivial solutions of the Neumann problem for p-Laplacian systems using Morse theory.

2007
D. D. Hai Haiyan Wang Steven G. Krantz

The paper deals with the existence and nonexistence of nontrivial nonnegative solutions for the sublinear quasilinear system div (|∇ui |p−2∇ui)+ λfi(u1, . . . , un)= 0 in Ω, ui = 0 on ∂Ω, i = 1, . . . , n, where p > 1, Ω is a bounded domain in RN (N 2) with smooth boundary, and fi , i = 1, . . . , n, are continuous, nonnegative functions. Let u = (u1, . . . , un), ‖u‖ = ∑n i=1 |ui |, we prove t...

The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...

2013
Olivia Simpson

Solving a system of linear equations is a fundamental problem that has deep implications in the computational sciences, engineering, and applied mathematics. The problem has a long history and, until recently, has not broken polynomial time bounds. In this report we present a survey of the algorithms that solve symmetric diagonally dominant linear systems in near-linear time. We also discuss a ...

Journal: :CoRR 2016
François Le Gall

We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of n linear equations in n variables require Ω(log 2 n) space, Ta-Shma (STOC 2013) recently showed that on a quantum computer an approximate solution can be computed in logarithmic space, giving the first explicit computational task for which...

Journal: :International journal of psychophysiology : official journal of the International Organization of Psychophysiology 2015
Dennis J McFarland

Brain-computer interface (BCI) systems frequently use signal processing methods, such as spatial filtering, to enhance performance. The surface Laplacian can reduce spatial noise and aid in identification of sources. In BCI research, these two functions of the surface Laplacian correspond to prediction accuracy and signal orthogonality. In the present study, an off-line analysis of data from a ...

2008
Donal O’Regan Haiyan Wang

The paper deals with the existence of positive radial solutions for the p-Laplacian system div(|∇ui| ∇ui) + f (u1, . . . , un) = 0, |x| < 1, ui(x) = 0, on |x| = 1, i = 1, . . . , n, p > 1, x ∈ R . Here f , i = 1, . . . , n, are continuous and nonnegative functions. Let u = (u1, . . . , un), ‖u‖ = ∑n i=1|ui|, f i 0 = lim‖u‖→0 f(u) ‖u‖p−1 , f i ∞ = lim‖u‖→∞ f(u) ‖u‖p−1 , i = 1, . . . , n, f = (f1...

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

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