The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Blow-up for 3-D compressible isentropic Navier-Stokes-Poisson equations

Shanshan YangHongbiao JiangYinhe Lin — 2021

Czechoslovak Mathematical Journal

We study compressible isentropic Navier-Stokes-Poisson equations in 3 . With some appropriate assumptions on the density, velocity and potential, we show that the classical solution of the Cauchy problem for compressible unipolar isentropic Navier-Stokes-Poisson equations with attractive forcing will blow up in finite time. The proof is based on a contradiction argument, which relies on proving the conservation of total mass and total momentum.

A tight bound of modified iterative hard thresholding algorithm for compressed sensing

Jinyao MaHaibin ZhangShanshan YangJiaojiao Jiang — 2023

Applications of Mathematics

We provide a theoretical study of the iterative hard thresholding with partially known support set (IHT-PKS) algorithm when used to solve the compressed sensing recovery problem. Recent work has shown that IHT-PKS performs better than the traditional IHT in reconstructing sparse or compressible signals. However, less work has been done on analyzing the performance guarantees of IHT-PKS. In this paper, we improve the current RIP-based bound of IHT-PKS algorithm from δ 3 s - 2 k < 1 32 0 . 1768 to δ 3 s - 2 k < 5 - 1 4 0 . 309 , where δ 3 s - 2 k is the restricted...

Page 1

Download Results (CSV)