The discontinuous Galerkin (DG) method provides a robust and flexible technique for the time integration of fractional diffusion problems. However, a practical implementation uses coefficients defined by integrals that are not easily evaluated. We describe specialized quadrature techniques that efficiently maintain the overall accuracy of the DG method. In addition, we observe in numerical experiments that known superconvergence properties of DG time stepping for classical diffusion problems carry over in a modified form to the fractional-order setting.

Longer-lived cows tend to be more profitable and the stayability trait is a selection criterion correlated to longevity. An alternative to the traditional approach to evaluate stayability is its definition based on consecutive calvings, whose main advantage is the more accurate evaluation of young bulls. However, no study using this alternative approach has been conducted for Zebu breeds. Therefore, the objective of this study was to compare linear random regression models to fit stayability to consecutive calvings of Guzerá, Nelore and Tabapuã cows and to estimate genetic parameters for this trait in the respective breeds. Data up to the eighth calving were used. The models included the fixed effects of age at first calving and year-season of birth of the cow and the random effects of contemporary group, additive genetic, permanent environmental and residual. Random regressions were modeled by orthogonal Legendre polynomials of order 1 to 4 (2 to 5 coefficients) for contemporary group, additive genetic and permanent environmental effects. Using Deviance Information Criterion as the selection criterion, the model with 4 regression coefficients for each effect was the most adequate for the Nelore and Tabapuã breeds and the model with 5 coefficients is recommended for the Guzerá breed. For Guzerá, heritabilities ranged from 0.05 to 0.08, showing a quadratic trend with a peak between the fourth and sixth calving. For the Nelore and Tabapuã breeds, the estimates ranged from 0.03 to 0.07 and from 0.03 to 0.08, respectively, and increased with increasing calving number. The additive genetic correlations exhibited a similar trend among breeds and were higher for stayability between closer calvings. Even between more distant calvings (second v. eighth), stayability showed a moderate to high genetic correlation, which was 0.77, 0.57 and 0.79 for the Guzerá, Nelore and Tabapuã breeds, respectively. For Guzerá, when the models with 4 or 5 regression coefficients were compared, the rank correlations between predicted breeding values for the intercept were always higher than 0.99, indicating the possibility of practical application of the least parameterized model. In conclusion, the model with 4 random regression coefficients is recommended for the genetic evaluation of stayability to consecutive calvings in Zebu cattle.

In this paper, we consider an optimal control problem governed by Stokes equations with H1-norm state constraint. The control problem is approximated by spectral method, which provides very accurate approximation with a relatively small number of unknowns. Choosing appropriate basis functions leads to discrete system with sparse matrices. We first present the optimality conditions of the exact and the discrete optimal control systems, then derive both a priori and a posteriori error estimates. Finally, an illustrative numerical experiment indicates that the proposed method is competitive, and the estimator can indicate the errors very well.

Various numerical methods have been developed in order to solve complex systems with uncertainties, and the stochastic collocation method using l1-minimisation on low discrepancy point sets is investigated here. Halton and Sobol' sequences are considered, and low discrepancy point sets and random points are compared. The tests discussed involve a given target function in polynomial form, high-dimensional functions and a random ODE model. Our numerical results show that the low discrepancy point sets perform as well or better than random sampling for stochastic collocation via l1-minimisation.

The maximum entropy method for the Hausdorff moment problem suffers from ill conditioning as it uses monomial basis {1,x,x2,...,xn}. The maximum entropy method for the Chebyshev moment probelm was studied to overcome this drawback in. In this paper we review and modify the maximum entropy method for the Hausdorff and Chebyshev moment problems studied in and present the maximum entropy method for the Legendre moment problem. We also give the algorithms of converting the Hausdorff moments into the Chebyshev and Lengendre moments, respectively, and utilizing the corresponding maximum entropy method.

In this paper, we show that the $\gamma $-vectors of Coxeter complexes (of types A and B) and associahedrons (of types A and B) can be obtained by using derivative polynomials of the tangent and secant functions. We provide a unified grammatical approach to generate these $\gamma $-vectors and the coefficient arrays of Narayana polynomials, Legendre polynomials and Chebyshev polynomials of both kinds.