Macro-elements of arbitrary smoothness are constructed on Powell-Sabin triangle splits. These elements are useful for solving boundaryvalue problems and for interpolation of Hermite data. It is shown that they are optimal with respect to spline degree, and we believe they are also optimal with respect to the number of degrees of freedom. The construction provides local bases for certain supersp...

A hybrid method combining the FR conjugate gradient method and the WYL conjugate gradient method is proposed for unconstrained optimization problems. The presented method possesses the sufficient descent property under the strong Wolfe-Powell SWP line search rule relaxing the parameter σ < 1. Under the suitable conditions, the global convergence with the SWP line search rule and the weak Wolfe-...

This paper proposes to extend the band width of narrow band telephone speech signal by employing feed forward back propagation neural network. There are different types of faster training algorithm are available in the literature like Variable Learning Rate, Resilient Back propagation, Polak-Ribiére Conjugate Gradient , Conjugate Gradient with Powell/Beale Restarts , BFGS Quasi-Newton , One-Ste...

This paper proposes to extend the band width of narrow band telephone speech signal by employing feed forward back propagation neural network. There are different types of faster training algorithm are available in the literature like Variable Learning Rate, Resilient Back propagation, Polak-Ribiére Conjugate Gradient , Conjugate Gradient with Powell/Beale Restarts , BFGS Quasi-Newton , One-Ste...

During much of the 21st century, natural runoff in Colorado River basin has declined, while consumption remained relatively constant, leading to historically low reservoir storage. Between January 2000 and April 2023, amount water stored Lake Mead Powell, two largest reservoirs United States, declined by 33.5 million acre feet (41.3 billion cubic meters). As total basin-wide storage was suffici...

Addressing scheduling problems with the best graph coloring algorithm has always been very challenging. However, university timetable problem can be formulated as a where courses are represented vertices and presence of common students or teachers corresponding edges. After that, stands to color lowest possible colors. In order accomplish this task, paper presents comparative study use in sched...